Handbook of Formal Languages
Membrane Computing: An Introduction
Membrane Computing: An Introduction
The power of communication: P systems with symport/antiport
New Generation Computing
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 membrane systems
Theoretical Computer Science
On three classes of automata-like P systems
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Context-free languages can be accepted with absolutely no space overhead
Information and Computation
Theoretical Computer Science
On the Computational Power of 1-Deterministic and Sequential P Systems
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Theoretical Computer Science
P Automata: Membrane Systems as Acceptors
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Computing with cells: membrane systems-some complexity issues
International Journal of Parallel, Emergent and Distributed Systems
Context-free languages can be accepted with absolutely no space overhead
Information and Computation
On the parallelizability of languages accepted by P automata
Computation, cooperation, and life
On bounded symport/antiport P systems
DNA'05 Proceedings of the 11th international conference on DNA Computing
On symport/antiport p systems and semilinear sets
WMC'05 Proceedings of the 6th international conference on Membrane Computing
P systems: some recent results and research problems
UPP'04 Proceedings of the 2004 international conference on Unconventional Programming Paradigms
Some computational issues in membrane computing
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
WMC'04 Proceedings of the 5th international conference on Membrane Computing
P automata: concepts, results, and new aspects
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Variants of distributed p automata and the efficient parallelizability of languages
CMC'11 Proceedings of the 12th 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 Computational Power of 1-Deterministic and Sequential P Systems
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
| Hi-index | 0.00 |
We characterize the classes of languages described by P automata, i.e., accepting P systems with communication rules only. Motivated by properties of natural computing systems, we study computational complexity classes with a certain restriction on the use of the available workspace in the course of computations and relate these to the language classes described by P automata. We prove that if the rules of the P system are applied sequentially, then the accepted language class is strictly included in the class of languages accepted by one-way Turing machines with a logarithmically bounded workspace, and if the rules are applied in the maximal parallel manner, then the class of context-sensitive languages is obtained.