Skip to main content
SpringerLink
Log in

dP Automata versus Right-Linear Simple Matrix Grammars

  • Chapter
Computation, Physics and Beyond (WTCS 2012)

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

Included in the following conference series:

Abstract

We consider dP automata with the input string distributed in an arbitrary (hence not necessary balanced) way, and we investigate their language accepting power, both in the case when a bound there is on the number of objects present inside the system and in the general case. The relation with right-linear simple matrix grammars is useful in this respect. Some research topics and open problems are also formulated.

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-Varju, E., Vaszil, G.: A connection between finite dP automata and multi-head finite automata. In: Proc. Twelfth Intern. Conf. of Membrane Computing, CMC 12, Fontainebleau, France, pp. 109–126 (August 2011)

    Google Scholar 

  2. Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)

    Book  MATH  Google Scholar 

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

  4. Hromkovic, J.: Communication Complexity and Parallel Computing: The Application of Communication Complexity in Parallel Computing. Springer, Berlin (1997)

    Book  MATH  Google Scholar 

  5. Ibarra, O.: Simple matrix grammars. Information and Control 17, 359–394 (1970)

    Article  MathSciNet  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  7. 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 and Control 5(2), 238–252 (2010)

    Article  Google Scholar 

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

  9. Păun, G., Pérez-Jiménez, M.J.: An infinite hierarchy of languages defined by dP Systems. Theoretical Computer Sci. (in press)

    Google Scholar 

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

    Google Scholar 

  11. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 3. Springer, Berlin (1998)

    Google Scholar 

  12. The P Systems Website, http://ppage.psystems.eu

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics of the Romanian Academy, PO Box 1-764, 014700, Bucureşti, Romania

    Gheorghe Păun

  2. Department of Computer Science and Artificial Intelligence, University of Sevilla, Avda. Reina Mercedes s/n, 41012, Sevilla, Spain

    Gheorghe Păun & Mario J. Pérez-Jiménez

Authors
  1. Gheorghe Păun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mario J. Pérez-Jiménez
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Auckland, Private Bag 92019, 1142, Auckland, New Zealand

    Michael J. Dinneen , Bakhadyr Khoussainov  & André Nies ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Păun, G., Pérez-Jiménez, M.J. (2012). dP Automata versus Right-Linear Simple Matrix Grammars. In: Dinneen, M.J., Khoussainov, B., Nies, A. (eds) Computation, Physics and Beyond. WTCS 2012. Lecture Notes in Computer Science, vol 7160. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27654-5_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27654-5_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27653-8

  • Online ISBN: 978-3-642-27654-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation