Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

A class of restricted P colonies with string environment

  • Published:
Natural Computing Aims and scope Submit manuscript

Abstract

In this paper we continue the study of variants of P colonies, called APCol systems, where the environment is given as a string and the model is an accepting system. We develop the concept by introducing the notion of the generating working mode. We then compare the power of a special subclass of APCol systems working in the generating mode to the power of register machines and context-free matrix grammars without appearance checking.

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

  • Cienciala L, Ciencialová L, Kelemenová A (2007) On the number of agents in P colonies. In: Eleftherakis G, Kefalas P, Păun Gh, Rozenberg G, Salomaa A (eds) Workshop on membrane computing. Springer, Lecture Notes in Computer Science, vol 4860, pp 193–208

  • Cienciala L, Ciencialová L, Kelemenová A (2008) Homogeneous P colonies. Comput Inform 27(3+):481–496

    MathSciNet  MATH  Google Scholar 

  • Cienciala L, Ciencialová L, Csuhaj-Varjú E, Vaszil G (2010) Pcol automata: recognizing strings with P colonies. In: Proceedings of BWMC 2010, Sevilla, 2010. Fénix Editora, Sevilla, Spain, pp 65–76

  • Cienciala L, Ciencialová L, Csuhaj-Varjú E (2014) Towards on P colonies processing strings. In: Proceedings of BWMC 2014, Sevilla, 2014. Fénix Editora, Sevilla, Spain, pp 102–118

  • Ciencialová L, Cienciala L (2006) Variation on the theme: P colonies. In: Proceedings of the international workshop on formal models Prerov, the Czech Republic, April 25–27, 2006. CEUR workshop proceedings, Ostrava, pp 27–34

  • Ciencialová L, Csuhaj-Varjú E, Kelemenová A, Vaszil G (2009) Variants of P colonies with very simple cell structure. Int J Comput Commun Control 4(3):224–233

    Article  Google Scholar 

  • Csuhaj-Varjú E, Kelemen J, Kelemenová A (2006a) Computing with cells in environment: P colonies. Multiple-Valued Logic Soft Comput 12(3–4):201–215

    MathSciNet  MATH  Google Scholar 

  • Csuhaj-Varjú E, Margenstern M, Vaszil G (2006b) P colonies with a bounded number of cells and programs. In: Hoogeboom HJ, Păun G, Rozenberg G, Salomaa A (eds) Workshop on membrane computing. Springer, Lecture Notes in Computer Science, vol 4361, pp 352–366

  • Dassow J, Păun Gh (1989) Regulated rewriting in formal language theory, EATCS monographs in theoretical computer science, vol 18. Springer, Berlin

    Book  Google Scholar 

  • Freund R, Oswald M (2005) P colonies working in the maximally parallel and in the sequential mode. In: Ciobanu G, Păun Gh (eds) Pre-proceedings of first international workshop on theory and application of P systems, Timisoara, Romania, September 26–27, pp 49–56

  • Freund R, Oswald M (2006) P colonies and prescribed teams. Int J Comput Math 83(7):569–592

    Article  MathSciNet  MATH  Google Scholar 

  • Greibach S (1978) Remarks on blind and partially blind one-way multicounter machines. Theor Comput Sci 7(3):311–324

    Article  MathSciNet  MATH  Google Scholar 

  • Hopcroft JE, Motwani R, Ullman JD (2006) Introduction to automata theory, languages, and computation, 3rd edn. Addison-Wesley Longman Publishing Co. Inc, Boston

    MATH  Google Scholar 

  • Kelemen J, Kelemenová A, Păun Gh (2004) Preview of P colonies: a biochemically inspired computing model. In: Workshop and tutorial proceedings. Ninth international conference on the simulation and synthesis of living systems (Alife IX), Boston, Massachusetts, USA, pp 82–86

  • Meduna A, Zemek P (2012) Jumping finite automata. Int J Found Comput Sci 23(7):1555–1578

    Article  MathSciNet  MATH  Google Scholar 

  • Minsky ML (1967) Computation: finite and infinite machines. Prentice-Hall Inc, Upper Saddle River

    MATH  Google Scholar 

  • Păun Gh, Rozenberg G, Salomaa A (eds) (2010) The Oxford handbook of membrane computing. Oxford University Press, New York

  • Rozenberg G, Salomaa A (eds) (1997) Handbook of formal languages, vol 1: word, language, grammar. Springer, New York

Download references

Acknowledgments

The authors express their gratitude to the referees of the first version of this paper for their valuable suggestions and comments to improve the presentation of the paper. The idea of considering restricted APCol systems as multiset generating devices instead of string generating systems, mentioned above, was suggested by one the referees. This work was partially supported by project LQ1602 - IT4Innovations excellence in science, by SGS/24/2013 and SGS/6/2014.

Author information

Authors and Affiliations

  1. Institute of Computer Science and Research Institute of the IT4Innovations Centre of Excellence, Silesian University in Opava, Opava, Czech Republic

    Luděk Cienciala & Lucie Ciencialová

  2. Faculty of Informatics, Eötvös Loránd University, Budapest, Hungary

    Erzsébet Csuhaj-Varjú

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

  3. Erzsébet Csuhaj-Varjú
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Erzsébet Csuhaj-Varjú.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Cienciala, L., Ciencialová, L. & Csuhaj-Varjú, E. A class of restricted P colonies with string environment. Nat Comput 15, 541–549 (2016). https://doi.org/10.1007/s11047-016-9564-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11047-016-9564-3

Keywords

Search

Navigation