Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Membrane automata with priorities

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In this paper the one-way P automata with priorities are introduced. Such automata are P systems where the membranes are only allowed to consume objects from parent membranes, under the given conditions. The result of computation of these systems is the set of multiset sequences consumed by skin membrane into the system. The rules associated in some order with each membrane, cannot modify any objects, they can only move them through membrane. We show that P automata with priorities and two membranes can accept every recursively enumerated language.

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

Access this article

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

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Pâun G. Computing with membranes. Turku Centre for Computer Science — TUCS Report No 208, 1998.

  2. Csuhaj-Varjú E, Vaszil G. P automata. In [8]Pre-Proceedings of Workshop on Membrane Computing,WMC-CdeA2002, Curtea de Arges, Romania, 2002. pp.177–192.

  3. Pâun G. Membrane Computing, An Introduction. Springer-Verlag, Berlin-Heidelberg, 2002.

    MATH  Google Scholar 

  4. Pâun G. Computing with membranes (P systems): Twenty six research topics. CDMTcs Technical Report 119, Univ. of Aucland, 2000, pp.203–217.

  5. Hopcroft J E, Ullman J D. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, Mass., 1979.

    MATH  Google Scholar 

  6. Fisher P C. Turing machines with restricted memory access.Information and Control, 1966. 9: 364–379.

    Article  MathSciNet  Google Scholar 

  7. Freud R, Martin-Vide C, Obtulowicz A, Pâun G. On three classes of automata-like P systems.DTL 2003, Szeged.

  8. Pâun G, Zandron C. Pre-Proceedings of Workshop on Membrane Computing,WMC-CdeA2002, Curtea de Arges, Romania, 2002.

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Silesian University, 746 01, Opava, Czech Republic

    Luděk Cienciala & Lucie Ciencialová

Authors
  1. Luděk Cienciala
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lucie Ciencialová
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Luděk Cienciala.

Additional information

Luděk Cienciala received the M.S. degree from the University of Ostrava in 1996. He is currently an assistant professor in the Institute of Computer Science of the Faculty of Philosophy and Science of Silesian University in Opava. His research interests are formal language theory and computer graphics.

Lucie Ciencialová received the B.S. degree in applicated mathematics of economic from the Mathematical Institute of Silesian University in Opava. She is currently studing at the Silesian University in Opava. Her research interests are in formal language theory.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cienciala, L., Ciencialová, L. Membrane automata with priorities. J. Comput. Sci. & Technol. 19, 89–97 (2004). https://doi.org/10.1007/BF02944787

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation