Skip to main content
SpringerLink
Log in

Variants of Distributed P Automata and the Efficient Parallelizability of Languages

  • Conference paper
Membrane Computing (CMC 2011)

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

Included in the following conference series:

  • 517 Accesses

Abstract

We give an overview of P automata and distributed P automata and the parallelizability of their accepted languages by focusing on those features of these systems which influence the efficiency of the parallelization.

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

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.) DNA 2004. LNCS, vol. 3384, pp. 76–89. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

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

  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)

    Chapter  Google Scholar 

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

  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 Mathematical-Informatics Series LVIII, pp. 5–22 (2009)

    Google Scholar 

  6. Păun, G., Pérez-Jiménez, M.J.: Solving problems in a distributed way in membrane computing: dP systems. International Journal of Computing, Communication and Control V(2), 238–250 (2010)

    Article  Google Scholar 

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

    Chapter  Google Scholar 

  8. Păun, G., Pérez-Jiménez, M.J.: An infinite hierarchy of languages defined by dP systems. Theoretical Computer Science (to appear)

    Google Scholar 

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

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

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer and Automation Research Institute, Hungarian Academy of Sciences, Kende utca 13-17, 1111, Budapest, Hungary

    György Vaszil

Authors
  1. György Vaszil
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science, University of Sheffield, Regent Court, Portobello Street, S1 4DP, Sheffield, UK

    Marian Gheorghe

  2. Institute of Mathematics of the Romanian Academy, P.O. Box 1-764, 014700, Bucharest, Romania

    Gheorghe Păun

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

    Grzegorz Rozenberg

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

    Arto Salomaa

  5. Faculté des Sciences et Technologie, Laboratoire d’Algorithmique, Complexité et Logique (LACL), Université Paris Est – Créteil Val de Marne, 61, av. Général de Gaulle, 94010, Créteil, France

    Sergey Verlan

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vaszil, G. (2012). Variants of Distributed P Automata and the Efficient Parallelizability of Languages. 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_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28024-5_5

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

Publish with us

Policies and ethics

Search

Navigation