Abstract
We describe a connection between dP automata (distributed P automata) and non-deterministic multi-head finite automata. We introduce the concepts of agreement languages of dP automata, and the notion of a two-way dP automaton. We demonstrate how the languages of non-deterministic one-way and two-way multi-head finite automata can be obtained as the agreement languages of one-way and two-way finite dP automata.
Research supported in part by the Hungarian Scientific Research Fund, “OTKA”, project K75952.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Birget, J.-C.: Two-way automaton computations. RAIRO Informatique Théorique et Applications 24, 44–66 (1990)
Csuhaj-Varjú, E., Ibarra, O.H., Vaszil, G.: On the computational complexity of P automata. Natural Computing 5(2), 109–126 (2006)
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., 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 (2010)
Freund, R., Kogler, M., Păun, G., Pérez-Jiménez, M.J.: On the power of P and dP automata. Annals of Bucharest University. Mathematics-Informatics Series 63, 5–22 (2009)
Hartmanis, J.: On non-determinacy in simple computing devices. Acta Informatica 1, 336–344 (1972)
Holzer, M., Kutrib, M., Malcher, A.: Complexity of multi-head finite automata: Origins and directions. Theoretical Computer Science 412, 83–96 (2011)
Păun, G.: Membrane Computing: An Introduction. Natural Computing Series. Springer, Berlin (2002)
Păun, G., Pérez-Jiménez, M.J.: Solving problems in a distributed way in membrane computing: dP systems. International Journal of Computers, Communication & Control V(2), 238–250 (2010)
Păun, G., Pérez-Jiménez, M.J.: P and dP Automata: A Survey. In: Calude, C.S., Rozenberg, G., Salomaa, A. (eds.) Maurer Festschrift. LNCS, vol. 6570, pp. 102–115. Springer, Heidelberg (2011)
Păun, G., Pérez-Jiménez, M.J.: An Infinite Hierarchy of Languages Defined by dP Systems (submitted)
Păun, G., Rozenberg, G., Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing. Oxford University Press (2010)
Rabin, M.O., Scott, D.: Finite automata and their decision problems. In: Sequential Machines - Selected Papers, pp. 63–91. Addison-Wesley (1964)
Rosenberg, A.L.: On multi-head finite automata. IBM Journal of Research and Development 10, 388–394 (1966)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)
Wagner, K., Wechsung, G.: Computational Complexity. Reidel, Dordrecht (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Csuhaj-Varjú, E., Vaszil, G. (2012). Finite dP Automata versus Multi-head Finite Automata. In: Gheorghe, M., Păun, G., Rozenberg, G., Salomaa, A., Verlan, S. (eds) Membrane Computing. CMC 2011. Lecture Notes in Computer Science, vol 7184. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28024-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-28024-5_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28023-8
Online ISBN: 978-3-642-28024-5
eBook Packages: Computer ScienceComputer Science (R0)