Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
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
Evolution-Communication P Systems
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
On three classes of automata-like P systems
DLT'03 Proceedings of the 7th international conference on Developments in language theory
A multiset-based model of synchronizing agents: Computability and robustness
Theoretical Computer Science
Number of protons/bi-stable catalysts and membranes in p systems. time-freeness
WMC'05 Proceedings of the 6th international conference on Membrane Computing
P automata: concepts, results, and new aspects
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Properties of membrane systems
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions
Fundamenta Informaticae - Machines, Computations and Universality, Part I
| Hi-index | 0.00 |
Evolution-communication P systems are a variant of P systems allowing both rewriting rules and symport/antiport rules, thus having separated the rewriting and the communication. The purpose of this paper is to solve an open problem stated in Reference [1], namely generating the family of Turing computable sets of vectors of natural numbers instead of the family of Turing computable sets of natural numbers. The same construction also reduces the 3-membrane non-cooperative case and the 2-membrane 1-catalyst case to the 2-membrane non-cooperative case. Also, EC P automata are introduced and it is proved that 2-membrane EC P automata with a promoter can accept all recursively enumerable languages. Finally, a definition of an extended system is given, and its universality is proved using the rules of more restricted types.