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

P and dP Automata: Unconventional versus Classical Automata

  • Conference paper
Developments in Language Theory (DLT 2012)

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

Included in the following conference series:

  • 775 Accesses

Abstract

In this paper we discuss P automata and their distributed systems, called dP automata, constructs combining properties of classical automata and membrane systems being in interaction with their environments. We describe the most important variants and their properties, demonstrate their standard and non-standard features compared to characteristics of classical automata.

Research supported in part by the Hungarian Scientific Research Fund (OTKA), Grant no. K75952.

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. Bel-Enguix, G., Gramatovici, R.: Parsing with P automata. In: Ciobanu, G., Pérez-Jiménez, M.J., Păun, G. (eds.) Applications of Membrane Computing. Natural Computing Series, pp. 389–410. Springer, Berlin (2006)

    Google Scholar 

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

    MathSciNet  Google Scholar 

  3. Cardelli, L.: Brane Calculi. Interactions of Biological Membranes. In: Danos, V., Schachter, V. (eds.) CMSB 2004. LNCS (LNBI), vol. 3082, pp. 257–278. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Csuhaj-Varjú, E.: P Automata. In: Mauri, G., Păun, G., Pérez-Jiménez, M.J., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol. 3365, pp. 19–35. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Csuhaj-Varjú, E.: P Automata: Concepts, Results, and New Aspects. 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. 1–15. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

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

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

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

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

  11. Csuhaj-Varjú, E., Vaszil, G.: (Mem)brane automata. Theoretical Computer Science 404(1-2), 52–60 (2008)

    Article  MathSciNet  MATH  Google Scholar 

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

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

    Chapter  Google Scholar 

  14. Freund, R., Kogler, M., Păun, G., Pérez-Jiménez, M.J.: On the power of P and dP automata. Mathematics-Informatics Series, vol. 63, pp. 5–22. Annals of Bucharest University (2009)

    Google Scholar 

  15. Freund, R., Martín-Vide, C., Obtułowicz, A., Păun, G.: On Three Classes of Automata-like P Systems. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 292–303. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  17. Freund, R., Oswald, M., Staiger, L.: ω-P Automata with Communication Rules. In: Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2003. LNCS, vol. 2933, pp. 203–217. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  18. Freund, R., Verlan, S.: (Tissue) P systems working in the k-restricted minimally parallel derivation mode. In: Csuhaj-Varjú, E., Freund, R., Oswald, M., Salomaa, K. (eds.) International Workshop on Computing with Biomolecules, Wien, Austria, August 27, pp. 43–52. Österreichische Computer Gesellschaft (2008)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  21. Ibarra, O.H.: The Number of Membranes Matters. In: Alhazov, A., Martín-Vide, C., Păun, G. (eds.) WMC 2003. LNCS, vol. 2933, pp. 218–231. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  22. Ibarra, O.H.: On the Computational Complexity of Membrane Systems. Theoretical Computer Science 320(1), 89–109 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  23. Ibarra, O.H., Păun, G.: Characterization of context-sensitive languages and other language classes in terms of symport/antiport P systems. Theoretical Computer Science 358(1), 88–103 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  24. Kaminski, M., Francez, N.: Finite-memory automata. Theoretical Computer Science 134, 329–363 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  25. Martín-Vide, C., Păun, A., Păun, G.: On the power of P systems with symport rules. Journal of Universal Computer Science 8, 317–331 (2002)

    Google Scholar 

  26. Oswald, M.: P Automata. PhD dissertation, Vienna University of Technology, Vienna (2003)

    Google Scholar 

  27. Otto, F.: Classes of regular and context-free languages over countably infinite alphabets. Discrete Applied Mathematics 12, 41–56 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  28. Păun, A., Păun, G.: The power of communication: P systems with symport/antiport. New Generation Computing 20(3), 295–305 (2002)

    Article  MATH  Google Scholar 

  29. Păun, G.: Computing with membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  30. Păun, G.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)

    Book  MATH  Google Scholar 

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

    Google Scholar 

  32. Păun, G., Pérez-Jiménez, M.J.: P and dP Automata: A Survey. In: Calude, C.S., Rozenberg, G., Salomaa, A. (eds.) Rainbow of Computer Science. LNCS, vol. 6570, pp. 102–115. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  33. Păun, G., Pérez-Jiménez, M.J.: P automata revisited. Theoretical Computer Science (in press, 2012)

    Google Scholar 

  34. Păun, G., Pérez-Jiménez, M.J.: An Infinite Hierarchy of Languages Defined by dP Systems. Theoretical Computer Science (in press, 2012)

    Google Scholar 

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

    MATH  Google Scholar 

  36. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. I-III. Springer, Heidelberg (1997)

    MATH  Google Scholar 

  37. Vaszil, G.: Automata-like membrane systems - A natural way to describe complex phenomena. In: Campeanu, C., Pighizzini, G. (eds.) Proceedings of 10th International Workshop on Descriptional Complexity of Formal Systems, Charlottetown, PE, Canada, July 16-18, pp. 26–37. University of Prince Edwards Island (2008)

    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ú

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

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Deptartment of Electrical Engineering, National Taiwan University, 106, Taipei, Taiwan

    Hsu-Chun Yen

  2. Department of Computer Science, University of California, 93106, Santa Barbara, CA, USA

    Oscar H. Ibarra

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Csuhaj-Varjú, E. (2012). P and dP Automata: Unconventional versus Classical Automata. In: Yen, HC., Ibarra, O.H. (eds) Developments in Language Theory. DLT 2012. Lecture Notes in Computer Science, vol 7410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31653-1_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31653-1_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31652-4

  • Online ISBN: 978-3-642-31653-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation