Rodica Ceterchi

Array-rewriting P systems

We consider array languages (sets of picturesconsisting of symbols placed in the lattice points of the 2D grid) and thepossibility to handle them with P systems. After proving binary normal formsfor array matrix grammars (which, even in the case when no appearance checking isused, are known to generate the array languages of arbitrary array grammars), weprove that the P systems with context-free rules (with three membranes and no control on the communication or the use of rules) are computationally universal, able togenerate all computable array languages. Some open problems are also formulated.

Towards probabilistic model checking on p systems using PRISM

This paper presents the use of P systems and π-calculus to model interacting molecular entities and how they are translated into a probabilistic and symbolic model checker called PRISM.

Simulating Boolean Circuits with P Systems

We propose a model for simulating Boolean circuits with P systems. The simulation is done in two steps, by first simulating the gates of such a circuit, and next by showing how these can be combined to obtain actual circuits. The type of P systems used is with symbol objects, context-free rewriting rules and some other features like mobile catalysts, weak priorities and promoters.

Simulating the bitonic sort using P systems

This paper gives a version of the parallel bitonic sorting algorithm of Batcher, which can sort N elements in time O(log2 N). We apply it to the 2D mesh architecture, using the shuffled row-major indexing function. A correctness proof of the proposed algorithm is given. Two simulations with P systems are introduced and discussed. The first one uses dynamic communication graphs and follows the guidelines of the mesh version of the algorithm. The second simulation requires only symbol rewriting rules in one membrane.

On some classes of splicing languages

We introduce some classes of splicing languages generated with simple and semi-simple splicing rules, in both, the linear and circular cases. We investigate some of their properties.

P Systems with Parallel Rewriting for Chain Code Picture Languages

Chain code pictures are composed of unit lines in the plane, drawn according to a sequence of instructions left, right, up, down codified by words over \(\varSigma = \{ {l}, r, u, d \}\). P systems to generate such languages have been considered in previous work with sequential rewriting in the membranes. We consider here parallel rewriting, with the advantage of reducing the number of membranes. We also consider the problem of generating the finite approximations of space-filling curves, the Hilbert curve and the Peano curve.

ON SIMULATING A CLASS OF PARALLEL ARCHITECTURES

The purpose of this paper is twofold. On one hand, we introduce the concept of P system with dynamic communication graphs in its full generality, independent of applications. On the other hand, we illustrate one application of it to the simulation of a class of parallel architectures. In this last direction we extend previous work concerned with the simulation of particular architectures.

On two-dimensional mesh networks and their simulation with p systems

We analize in this paper the possibility of simulating the parallel architecture SIMD−MC2, also known as the two-dimensional mesh, with P systems with dynamic communication graphs. We illustrate this simulation for an algorithm which computes the sum of given integers. Next, we show how to extend the formalism to the reduction problem.

Tiling Rectangular Pictures with P Systems

We introduce a class of two-dimensional tiling languages which are distinct from the local and recognizable picture languages. These languages arise from tilings of the integer lattice Z 2. For such picture languages, we define a class of tissue-like P systems with active membranes as a generative device. We also make a comparison with the model introduced in [2,3] for the generation of local and recognizable two-dimensional languages, using a similar type of P systems.

Further results on generalised communicating P systems

Abstract In this paper we consider four restricted cases of the generalised communicating P systems and study their computational power, by providing improved results, with respect to the number of compartments involved. We illustrate the expressive power of these devices by modelling several problems, such as producer/consumer, workflow patterns, broadcasting problem and comparative operations. We also present some relationships between generalised communicating P systems and P colonies, tissue-like P systems with very simple components.