Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

On Counter Machines versus dP Automata

  • Conference paper
Membrane Computing (CMC 2013)

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

Included in the following conference series:

  • 662 Accesses

Abstract

Continuing the study of connections between classical and P automata variants, we show that dP automata, i.e., distributed systems of P automata, where the input multiset is mapped to the set of strings consisting of all permutations of its elements, are as powerful as the class of distributed systems of special counter machine acceptors. These variants of counter machines read multisets (represented as sets of all permutations of their elements) and manipulate counters in a conventional manner.

Supported in part by the Hungarian Scientific Research Fund, “OTKA”, grant no. K75952, and by the European Union through the TÁMOP-4.2.2.C-11/1/KONV-2012-0001 project which is co-financed by the European Social Fund.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Csuhaj-Varjú, E., Ibarra, O.H., Vaszil, G.: On the computational complexity of P automata. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA10. LNCS, vol. 3384, pp. 76–89. Springer, Heidelberg (2005)

    Google Scholar 

  2. Csuhaj-Varjú, E., Oswald, M., Vaszil, G.: P automata. In: [13], ch. 6, pp. 144–167

    Google Scholar 

  3. Csuhaj-Varjú, E., Vaszil, G.: P automata. In: Păun, G., Zandron, C. (eds.) Pre-Proceedings of the Workshop on Membrane Computing WMC-CdeA 2002, Curtea de Argeş, Romania, August 19-23, pp. 177–192, Pub. No. 1 of MolCoNet-IST-2001-32008 (2002)

    Google Scholar 

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

    Chapter  Google Scholar 

  5. Csuhaj-Varjú, E., Vaszil, G.: Finite dP Automata versus multi-head Finite Automata. In: Gheorghe, M., Păun, G., Rozenberg, G., Salomaa, A., Verlan, S. (eds.) CMC 2011. LNCS, vol. 7184, pp. 120–138. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  6. Csuhaj-Varjú, E., Vaszil, G.: On the power of P automata. In: Mauri, G., Dennunzio, A., Manzoni, L., Porreca, A.E. (eds.) UCNC 2013. LNCS, vol. 7956, pp. 55–66. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  7. Freund, R., Oswald, M.: A short note on analysing P systems. Bulletin of the EATCS 78, 231–236 (2002)

    MATH  MathSciNet  Google Scholar 

  8. 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 LVIII, 5–22 (2009)

    Google Scholar 

  9. Ibarra, O.H.: Membrane hierarchy in P systems. Theoretical Computer Science 334(1-3), 115–129 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  10. Monien, B.: Two-way multi-head automata over a one-letter alphabet. RAIRO - Informatique théorique/Theoretical Informatics 14(1), 67–82 (1980)

    MATH  MathSciNet  Google Scholar 

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

    Book  Google Scholar 

  12. 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 and Control V(2), 238–250 (2010)

    Google Scholar 

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

    Google Scholar 

  14. 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 

  15. Păun, G., Pérez-Jiménez, M.J.: An infinite hierarchy of languages defined by dP systems. Theoretical Computer Science 431, 4–12 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  16. Păun, G., Pérez-Jiménez, M.J.: P automata revisited. Theoretical Computer Science 454, 222–230 (2012)

    Article  MATH  MathSciNet  Google Scholar 

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

    Chapter  Google Scholar 

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

    MATH  Google Scholar 

  19. Vaszil, G.: On the parallelizability of languages accepted by P automata. In: Kelemen, J., Kelemenová, A. (eds.) Pǎun Festschrift. LNCS, vol. 6610, pp. 170–178. Springer, Heidelberg (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Algorithms and Their Applications, Faculty of Informatics, Eötvös Loránd University, Pázmány Péter sétány 1/c, 1117, Budapest, Hungary

    Erzsébet Csuhaj-Varjú

  2. Department of Computer Science, Faculty of Informatics, University of Debrecen, P.O. Box 12, 4010, Debrecen, Hungary

    György Vaszil

Authors
  1. Erzsébet Csuhaj-Varjú
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. György Vaszil
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, 5 Academiei Str, MD 2028, Chişinău, Republic of Moldova

    Artiom Alhazov  & Yurii Rogozhin  & 

  2. Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, 5 Academiei Str., MD 2028, Chişinău, Republic of Moldova

    Svetlana Cojocaru

  3. Department of Computer Science, University of Sheffield, 211 Portobello Street, S1 4DP, Sheffield, UK

    Marian Gheorghe

  4. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333 CA, Leiden, The Netherlands

    Grzegorz Rozenberg

  5. Turku Centre for Computer Science (TUCS), Leminkaisenkatu 14, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Csuhaj-Varjú, E., Vaszil, G. (2014). On Counter Machines versus dP Automata. In: Alhazov, A., Cojocaru, S., Gheorghe, M., Rogozhin, Y., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. CMC 2013. Lecture Notes in Computer Science, vol 8340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54239-8_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-54239-8_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-54238-1

  • Online ISBN: 978-3-642-54239-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation