Skip to main content

Finite dP Automata versus Multi-head Finite Automata

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7184)

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.

Keywords

  • Regular Language
  • Input Symbol
  • Input Word
  • Membrane Computing
  • Skin Membrane

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.

Research supported in part by the Hungarian Scientific Research Fund, “OTKA”, project K75952.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Birget, J.-C.: Two-way automaton computations. RAIRO Informatique Théorique et Applications 24, 44–66 (1990)

    MathSciNet  MATH  Google Scholar 

  2. Csuhaj-Varjú, E., Ibarra, O.H., Vaszil, G.: On the computational complexity of P automata. Natural Computing 5(2), 109–126 (2006)

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. 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)

    CrossRef  Google Scholar 

  4. 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)

    Google Scholar 

  5. 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)

    MathSciNet  MATH  Google Scholar 

  6. Hartmanis, J.: On non-determinacy in simple computing devices. Acta Informatica 1, 336–344 (1972)

    CrossRef  MATH  Google Scholar 

  7. Holzer, M., Kutrib, M., Malcher, A.: Complexity of multi-head finite automata: Origins and directions. Theoretical Computer Science 412, 83–96 (2011)

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. Păun, G.: Membrane Computing: An Introduction. Natural Computing Series. Springer, Berlin (2002)

    CrossRef  MATH  Google Scholar 

  9. 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)

    CrossRef  Google Scholar 

  10. 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)

    Google Scholar 

  11. Păun, G., Pérez-Jiménez, M.J.: An Infinite Hierarchy of Languages Defined by dP Systems (submitted)

    Google Scholar 

  12. Păun, G., Rozenberg, G., Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing. Oxford University Press (2010)

    Google Scholar 

  13. Rabin, M.O., Scott, D.: Finite automata and their decision problems. In: Sequential Machines - Selected Papers, pp. 63–91. Addison-Wesley (1964)

    Google Scholar 

  14. Rosenberg, A.L.: On multi-head finite automata. IBM Journal of Research and Development 10, 388–394 (1966)

    CrossRef  MathSciNet  MATH  Google Scholar 

  15. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)

    MATH  Google Scholar 

  16. Wagner, K., Wechsung, G.: Computational Complexity. Reidel, Dordrecht (1986)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)