Formal languages
Communication complexity and parallel computing
Communication complexity and parallel computing
Marcus Contextual Grammars
Handbook of Formal Languages
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Mathematical Theory of L Systems
Mathematical Theory of L Systems
Membrane Computing: An Introduction
Membrane Computing: An Introduction
P Automata or Purely Communicating Accepting P Systems
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
On the Computational Complexity of P Automata
Natural Computing: an international journal
The Oxford Handbook of Membrane Computing
The Oxford Handbook of Membrane Computing
Modeling population growth of Pyrenean chamois (Rupicapra p. pyrenaica) by using P-systems
CMC'10 Proceedings of the 11th international conference on Membrane computing
P finite automata and regular languages over countably infinite alphabets
WMC'06 Proceedings of the 7th international conference on Membrane Computing
WMC'04 Proceedings of the 5th international conference on Membrane Computing
An infinite hierarchy of languages defined by dP systems
Theoretical Computer Science
dP automata versus right-linear simple matrix grammars
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
| Hi-index | 0.00 |
This is a quick survey of basic notions and results related to P automata (P systems with symport/antiport rules working in the accepting mode), with some emphasis on the recently introduced dP automata (a distributed version of the standard P automata), ending with some open problems and research topics which we find of interest in this area.