Accepting multi-agent systems II
Acta Cybernetica - Special issue: selected papers of the workshop grammar systems: recent results and perspectives, Budapest, July 1996
Graph-controlled grammars as language acceptors
Journal of Automata, Languages and Combinatorics
Journal of Computer and System Sciences
Membrane Computing: An Introduction
Membrane Computing: An Introduction
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
A P Systems Flat Form Preserving Step-by-step Behaviour
Fundamenta Informaticae
Encoding-Decoding transitional systems for classes of p systems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Hi-index | 0.00 |
Membrane systems can be seen either as generators or as acceptors of multiset languages. In this paper we compare the expressive power of membrane systems working in accepting mode with that of membrane systems working in generating mode. Features like determinism, presence of promoters and of cooperative rules are considered. The comparison between some of the considered classes of membrane systems is carried out by defining encodings of one class into another.