Handbook of Formal Languages
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
The Oxford Handbook of Membrane Computing
The Oxford Handbook of Membrane Computing
On the computational complexity of P automata
DNA'04 Proceedings of the 10th international conference on DNA computing
A computational complexity theory in membrane computing
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
| Hi-index | 0.00 |
We continue the study of the efficiency of distributed P automata initialized in (Gh. Păun, and M. J. Pérez-Jiménez, Solving problems in a distributed way in membrane computing: dP systems, International Journal of Computing, Communication and Control. V(2), 238-250, (2010)). A language accepted by a P automaton is efficiently parallelizable if there exists a distributed P automaton which accepts the same language and its computations only take some fraction of the computing time of the non-distributed variant. We examine how one of the features of P automata, namely the choice of the mapping which maps the sequence of multisets imported by the system to the symbols of the alphabet of the accepted language, influences the efficient parallelizability of the accepted languages.