Journal of Computer and System Sciences
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Theoretical Computer Science - Natural computing
P Automata or Purely Communicating Accepting P Systems
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Theoretical Computer Science
Computing with Membranes
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
On three classes of automata-like P systems
DLT'03 Proceedings of the 7th international conference on Developments in language theory
On the computational complexity of P automata
DNA'04 Proceedings of the 10th international conference on DNA computing
P Automata: Membrane Systems as Acceptors
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
The family of languages generated by non-cooperative membrane systems
CMC'10 Proceedings of the 11th international conference on Membrane computing
Membrane systems working in generating and accepting modes: expressiveness and encodings
CMC'10 Proceedings of the 11th international conference on Membrane computing
Rainbow of computer science
Languages in membrane computing: some details for spiking neural p systems
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
P automata: concepts, results, and new aspects
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Look-Ahead evolution for p systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
P and dp automata: unconventional versus classical automata
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
On the properties of language classes defined by bounded reaction automata
Theoretical Computer Science
Theoretical Computer Science
| Hi-index | 0.01 |
In this paper we discuss P automata, i.e., accepting P systems, using in most cases only communication rules. We briefly describe the most important variants of these systems and report on their important properties, with special emphasis on their computational power and size. We also propose some new topics and problems for future research.