Skip to main content
SpringerLink
Log in

Minimizing evolution-communication P systems and automata

  • Special Feature
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

Evolution-communication P systems are a variant of P systems allowing both rewriting rules and symport/antiport rules, thus having separated the rewriting and the communication. The purpose of this paper is to solve an open problem stated in Reference,1) namely generating the family of Turing computable sets of vectors of natural numbers instead of the family of Turing computable sets of natural numbers. The same construction also reduces the 3-membrane non-cooperative case and the 2-membrane 1-catalyst case to the 2-membrane non-cooperative case. Also, EC P automata are introduced and it is proved that 2-membrane EC P automata with a promoter can accept all recursively enumerable languages. Finally, a definition of an extended system is given, and its universality is proved using the rules of more restricted types.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Cavaliere, M., “Evolution-Communication P Systems,” inMembrane Computing (Păun, G., Rozenberg, G., Salomaa, A. and Zandron, C. eds.),LNCS, 2597, pp. 134–145, Springer-Verlag, Berlin, 2003.

    Chapter  Google Scholar 

  2. Csuhaj-Varjuú, E. and Vaszil, G., “P Automata or Purely Communicating Accepting P Systems,” inMembrane Computing (Păun, G., Rozenberg, G., Salomaa, A. and Zandron, C., eds.),LNCS, 2597, pp. 219–233, Springer-Verlag, Berlin, 2003.

    Chapter  Google Scholar 

  3. Dassow, J. and Păun, G., “Regulated Rewriting in Formal Language Theory,” Springer-Verlag, Berlin, Heidelberg, 1989.

    Google Scholar 

  4. Freund, R., Martín-Vide, C., Obtulowicz, A. and Păun, G., “On Three Classes of Automata-Like P Systems,”Developments in Language Theory, Szeged, Hungary, 2003.

  5. Freund, R. and Oswald, M., “A Short Note on Analysing P Systems with Antiport Rules,”Bulletin of the EATCS, 78, pp. 231–236, Oct. 2002.

    MathSciNet  Google Scholar 

  6. Păun, G.,Membrane Computing. An Introduction, Springer-Verlag, Berlin, Heidelberg, 2002.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Group on Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tàrraco 1, 43005, Tarragona, Spain

    Artiom Alhazov

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

    Artiom Alhazov

Authors
  1. Artiom Alhazov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Artiom Alhazov: He has graduated from Mathematics and Computer Science, State University of Moldova in 2001, and is currently a Ph.D. student in Chişinăm, Moldova, and Tarragona, Spain. He has won prizes at 3 National Olympiads in Informatics and in Mathematics (1995 and 1996), participated at 8th International Olympiad in Informatics (Veszprem, Hungary, 1996). He has experience in programming and teaching, and has published 18 papers, mostly in Membrane Computing. His interests are Origami, Mathematics, Programming, Theoretical Computer Science, Formal Linguistics and Biocomputing.

About this article

Cite this article

Alhazov, A. Minimizing evolution-communication P systems and automata. New Gener Comput 22, 299–310 (2004). https://doi.org/10.1007/BF03037283

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037283

Keywords

Search

Navigation