Fernando Sancho-Caparrini

Hybrid networks of evolutionary processors

A hybrid network of evolutionary processors consists of several processors which are placed in nodes of a virtual graph and can perform one simple operation only on the words existing in that node in accordance with some strategies. Then the words which can pass the output filter of each node navigate simultaneously through the network and enter those nodes whose input filter was passed. We prove that these networks with filters defined by simple random-context conditions, used as language generating devices, are able to generate all linear languages in a very efficient way, as well as non-context-free languages. Then, when using them as computing devices, we present two linear solutions of the Common Algorithmic Problem.

Solving Knapsack Problems in a Sticker Based Model

Our main goal in this paper is to give molecular solutions for two NP-complete problems, namely Subset-sum and Knapsack, in a sticker based model for DNA computations. In order to achieve this, we have used a finite set sorting subroutine together with the description of a procedure to formally verify the designed programs through the labeling of test tubes using inductive techniques.

The P Versus NP Problem Through Cellular Computing with Membranes

We study the P versus NP problem through membrane systems. Language accepting P systems are introduced as a framework allowing us to obtain a characterization of the P ≠ NP relation by the polynomial time unsolvability of an NP–complete problem by means of a P system.

A prolog simulator for deterministic P systems with active membranes

In this paper we propose a new way to represent P systems with active membranes based on Logic Programming techniques. This representation allows us to express the set of rules and the configuration of the P system in each step of the evolution as literals of an appropriate language of first order logic. We provide a Prolog program to simulate, the evolution of these P systems and present some auxiliary tools to simulate the evolution of a P system with active membranes using 2-division which solves the SAT problem following the techniques presented in Reference.10

Computationally Hard Problems Addressed Through P Systems

In this chapter we present a general framework to provide efficient solutions to decision problems through families of cell-like membrane systems constructed in a semi-uniform way (associating with each instance of the problem one P system solving it) or a uniform way (all instances of a decision problem having the same size are processed by the same system). We also show a brief compendium of efficient semi-uniform and uniform solutions to hard problems in these systems, and we explicitly describe some of these solutions.

A MzScheme Implementation of Transition P Systems

The main goal of this paper is to present the design of an MzScheme program that allows us to simulate the behavior of transition P systems. For that, a library of procedures have been developed that work in two stages. In the first one, the parsing/compiling stage, the input P system is checked, and if it is well defined, then it is represented by means of an internal grammar. In a second stage, the simulation, the computation tree associated to the P system is generated until a prefixed level.

REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS

In this paper we analyze the dynamics of one-dimensional piecewise maps. We show that one-dimensional piecewise affine maps are equivalent to pseudo-billiard or so called “strange billiard” systems. We also show that use of more general classes of functions lead to undecidability of reachability problem for one-dimensional piecewise maps.

A SIMULATION ALGORITHM FOR MULTIENVIRONMENT PROBABILISTIC P SYSTEMS: A FORMAL VERIFICATION

Multienvironment probabilistic P systems provide a framework of specification for modeling population biology. It has been used to model real ecosystems in a comprehensible, modular and probabilistic way. However, simulators are needed for virtual experimentation. Hence, the development of correct simulation algorithms becomes a critical point. In this paper we present a formal verification of a new algorithm of simulation designed for this kind of probabilistic P systems.

Implementing in Prolog an Effective Cellular Solution to the Knapsack Problem

In this paper we present an implementation in Prolog of an effective solution to the Knapsack problem via a family of deterministic P systems with active membranes using 2-division.

Towards a digital geography of Hispanic Baroque art

In this article we propose an approach to the study of art history based on geography of Hispanic Baroque art by digital means that showcase the multiplicity of possible places of art. Our study advances four elements of a digital geography of art (communities, semantic maps, areas, and flows)—a methodology that can be expanded in future Digital Humanities research. .................................................................................................................................................................................