Skip to main content
SpringerLink
Log in
Book cover

International Conference on Membrane Computing

CMC 2012: Membrane Computing pp 101–111Cite as

Asynchronous and Maximally Parallel Deterministic Controlled Non-cooperative P Systems Characterize NFIN and coNFIN

  • Conference paper

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

Abstract

Membrane systems (with symbol objects) are distributed controlled multiset processing systems. Non-cooperative P systems with either promoters or inhibitors (of weight not restricted to one) are known to be computationally complete. In this paper we show that the power of the deterministic subclass of such systems is computationally complete in the sequential mode, but only subregular in the asynchronous mode and in the maximally parallel mode.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alhazov, A., Sburlan, D.: Ultimately Confluent Rewriting Systems. Parallel Multiset–Rewriting with Permitting or Forbidding Contexts. In: Mauri, G., Păun, G., Pérez-Jímenez, M.J., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol. 3365, pp. 178–189. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

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

    Google Scholar 

  3. Freund, R., Kari, L., Oswald, M., Sosík, P.: Computationally universal P systems without priorities: two catalysts are sufficient. Theor. Comp. Sci. 330, 251–266 (2005)

    Article  MATH  Google Scholar 

  4. Freund, R., Kogler, M., Oswald, M.: A General Framework for Regulated Rewriting Based on the Applicability of Rules. In: Kelemen, J., Kelemenová, A. (eds.) Computation, Cooperation, and Life. LNCS, vol. 6610, pp. 35–53. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  5. Ibarra, O.H., Yen, H.-C.: Deterministic catalytic systems are not universal. Theor. Comp. Sci. 363, 149–161 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. Kudlek, M., Martín-Vide, C., Păun, G.: Toward a Formal Macroset Theory. In: Calude, C.S., Pun, G., Rozenberg, G., Salomaa, A. (eds.) Multiset Processing. LNCS, vol. 2235, pp. 123–134. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs (1967)

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  10. Rozenberg, G., Salomaa, A.: Handbook of Formal Languages, vol. 3. Springer (1997)

    Google Scholar 

  11. The P Systems Web Page, http://ppage.psystems.eu

Download references

Author information

Authors and Affiliations

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

    Artiom Alhazov

  2. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Viale Sarca 336, 20126, Milano, Italy

    Artiom Alhazov

  3. Faculty of Informatics, Vienna University of Technology, Favoritenstr. 9, 1040, Vienna, Austria

    Rudolf Freund

Authors
  1. Artiom Alhazov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rudolf Freund
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Algorithms and Their Applications, 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, University of Sheffield, 211 Portobello Street, S1 4DP, Sheffield, UK

    Marian Gheorghe

  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. Department of Computer Science, University of Debrecen, Kassai út 26, 4028, Debrecen, Hungary

    György Vaszil

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alhazov, A., Freund, R. (2013). Asynchronous and Maximally Parallel Deterministic Controlled Non-cooperative P Systems Characterize NFIN and coNFIN . In: Csuhaj-Varjú, E., Gheorghe, M., Rozenberg, G., Salomaa, A., Vaszil, G. (eds) Membrane Computing. CMC 2012. Lecture Notes in Computer Science, vol 7762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36751-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36751-9_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-36750-2

  • Online ISBN: 978-3-642-36751-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation