Rainbow of Computer Science pp 102-115 | Cite as
P and dP Automata: A Survey
Chapter
Abstract
This is a quick survey of basic notions and results related to P automata (P systems with symport/antiport rules working in the accepting mode), with some emphasis on the recently introduced dP automata (a distributed version of the standard P automata), ending with some open problems and research topics which we find of interest in this area.
Keywords
Communication Complexity Regular Language Communication Step Balance Distribution Communication Rule
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Adorna, H., Păun, G., Pérez-Jiménez, M.J.: On communication complexity in evolution-communication P systems. In: Proc. 8th Brainstorming Week on Membrane Computing, Sevilla, and Romanian J. Information Theory and Applications (February 2010) (to appear)Google Scholar
- 2.Colomer, M.A., Lavín, S., Marco, I., Margalida, A., Pérez-Hurtado, I., Pérez-Jiménez, M.J., Sanuy, D., Serrano, E., Valencia-Cabrera, L.: Studying the evolution of Pyrenean Chamois by using P systems. In: Pre-proc. Conf. on Membrane Computing, CMC11, Jena, Germany (August 2010)Google Scholar
- 3.Csuhaj-Varjú, E.: P automata. In: Mauri, G., et al. (eds.) WMC 2004. LNCS, vol. 3365, pp. 19–35. Springer, Heidelberg (2005)CrossRefGoogle Scholar
- 4.Csuhaj-Varjú, E., Ibarra, O.H., Vaszil, G.: On the computational complexity of P automata. Natural Computing 5, 109–126 (2006)MathSciNetCrossRefMATHGoogle Scholar
- 5.Csuhaj-Varjú, E., Oswald, M., Vaszil, G.: P automata. In: [17], ch. 6, pp. 144–167Google Scholar
- 6.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)CrossRefGoogle Scholar
- 7.Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)CrossRefMATHGoogle Scholar
- 8.Dassow, J., Vaszil, G.: P finite automata and regular languages over countably infinite alphabets. In: Hoogeboom, H.J., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2006. LNCS, vol. 4361, pp. 367–381. Springer, Heidelberg (2006)CrossRefGoogle Scholar
- 9.Freund, R., Kogler, M., Păun, G., Pérez-Jiménez, M.J.: On the power of P and dP automata. In: Annals of Bucharest University. Mathematics-Informatics Series (2010) (in press)Google Scholar
- 10.Freund, R., Oswald, M.: A short note on analysing P systems. Bulletin of the EATCS 79, 231–236 (2002)MathSciNetMATHGoogle Scholar
- 11.Freund, R., Oswald, M., Staiger, L.: ω-P automata with communication rules. In: Martin-Vide, C., et al. (eds.) WMC 2003. LNCS, vol. 2933, pp. 203–217. Springer, Heidelberg (2004)CrossRefGoogle Scholar
- 12.Hromkovic, J.: Communication Complexity and Parallel Computing: The Application of Communication Complexity in Parallel Computing. Springer, Berlin (1997)CrossRefMATHGoogle Scholar
- 13.Oswald, M.: P Automata. PhD Thesis, TU Vienna (2003)Google Scholar
- 14.Păun, G.: Marcus Contextual Grammars. Kluwer, Dordrecht (1997)CrossRefMATHGoogle Scholar
- 15.Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)CrossRefMATHGoogle Scholar
- 16.Păun, G., Pérez-Jiménez, M.J.: Solving problems in a distributed way in membrane computing: dP systems. Int. J. of Computers, Communication and Control 5(2), 238–252 (2010)CrossRefGoogle Scholar
- 17.Păun, G., Rozenberg, G., Salomaa, A. (eds.): Handbook of Membrane Computing. Oxford University Press, Oxford (2010)MATHGoogle Scholar
- 18.Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press, New York (1980)MATHGoogle Scholar
- 19.Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, 3 volumes. Springer, Berlin (1998)Google Scholar
- 20.Salomaa, A.: Formal Languages. Academic Press, New York (1973)MATHGoogle Scholar
- 21.The P Systems Website, http://ppage.psystems.eu
Copyright information
© Springer-Verlag Berlin Heidelberg 2011