Journal of Computer and System Sciences
Computing with cells and atoms: an introduction to quantum, DNA and membrane computing
Computing with cells and atoms: an introduction to quantum, DNA and membrane computing
Handbook of Formal Languages
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Membrane Computing: An Introduction
Membrane Computing: An Introduction
GP Systems with forbidding context
Fundamenta Informaticae - Membrane computing
On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
From regulated rewriting to computing with membranes: collapsing hierarchies
Theoretical Computer Science
Computation: finite and infinite machines
Computation: finite and infinite machines
On Synchronization in P Systems
Fundamenta Informaticae
From Watson-Crick L systems to Darwinian P systems
Natural Computing: an international journal
Catalytic P systems, semilinear sets, and vector addition systems
Theoretical Computer Science
On the computational complexity of membrane systems
Theoretical Computer Science
Computationally universal P systems without priorities: two catalysts are sufficient
Theoretical Computer Science - Descriptional complexity of formal systems
Using well-structured transition systems to decide divergence for catalytic P systems
Theoretical Computer Science
On the decidability of model-checking for P systems
Journal of Automata, Languages and Combinatorics
UC'06 Proceedings of the 5th international conference on Unconventional Computation
On model-checking of p systems
UC'05 Proceedings of the 4th international conference on Unconventional Computation
Signaling p systems and verification problems
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
P systems: some recent results and research problems
UPP'04 Proceedings of the 2004 international conference on Unconventional Programming Paradigms
Implementation of catalytic p systems
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
The "classical" model of P systems was introduced by Gheorghe P驴un in 1998; this model with symbol objects was shown to be computationally universal in [8], provided that catalysts and priorities of rules are used. We now show by reduction via register machines that the priorities may be omitted from the model without loss of computational power. As a consequence, several universality results for P systems in [10] are improved.