Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)
Păun, G., Rozenberg, G., Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing. Oxford University Press, Oxford (2010)
Pérez–Jiménez, M.J.: A computational complexity theory in membrane computing. In: Păun, G., Pérez-Jiménez, M.J., Riscos-Núñez, A., Rozenberg, G., Salomaa, A. (eds.) WMC 2009. LNCS, vol. 5957, pp. 125–148. Springer, Heidelberg (2010)
Păun, G., Pérez-Jiménez, M.J.: Solving problems in a distributed way in membrane computing: dP systems. International Journal of Computing, Communication and Control V(2), 238–250 (2010)
Csuhaj–Varjú, E., Oswald, M., Vaszil, G.: P automata. In: Păun, G., Rozenberg, G., Salomaa, A. (eds.) The Oxford Handbook of Membrane Computing, ch. 6, pp. 144–167. Oxford University Press, Oxford (2010)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)
Csuhaj–Varjú, E., Vaszil, G.: P automata or purely communicating accepting P systems. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 219–233. Springer, Heidelberg (2003)
Csuhaj-Varjú, E., Ibarra, O.H., Vaszil, G.: On the Computational Complexity of P Automata. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol. 3384, pp. 76–89. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Vaszil, G. (2011). On the Parallelizability of Languages Accepted by P Automata. In: Kelemen, J., Kelemenová, A. (eds) Computation, Cooperation, and Life. Lecture Notes in Computer Science, vol 6610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20000-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-20000-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19999-8
Online ISBN: 978-3-642-20000-7
eBook Packages: Computer ScienceComputer Science (R0)