The main goal of this work is to formally describe P systems. This is a necessary step to subsequently apply Christiansen grammar evolution (an evolutionary tool developed by the authors) for automatic designing of P ...

We propose three quantum algorithms to solve the 3-SAT NP-complete decision problem. The first algorithm builds, for any instance Á of 3-SAT, a quantum Fredkin circuit that computes a superposition of all classical ...

We introduce dynamical probabilistic P systems, a variant where probabilities associated to the rules change during the evolution of the system, as a new approach to the analysis and simulation of the behavior of complex ...

P systems are parallel molecular computing models which process multisets of objects in cell-like membrane structures. In this paper we consider the trace languages of a special symbol, the traveler, in symport/antiport ...

The paper gives several results regarding P systems with non-cooperative rules and promoters/inhibitors at the level of rules. For the class of P systems using inhibitors, generating families of sets of vectors of numbers, ...

We show how P automata having a finite description and working with a finite object-alphabet can be used to describe languages over countably infinite alphabets. We propose to relate the language classes characterized ...

In this work we propose a new model of tree automata based on multisets of states and symbols linked to the finite control. This new model accepts a set of trees with symmetries between their internal nodes. We name this ...

We present a characterization of context-free languages in terms of a restricted class of P automata (P systems accepting strings of symbols using symport/antiport communication rules). The characterization is based on the ...

P systems provide a computational model based on the structure and interaction of living cells. A P system consists of a hierarchical nesting of cell-like membranes, which can be visualized as a rooted tree. Although ...