Skip to main content
SpringerLink
Log in
Book cover

International Conference on Membrane Computing

CMC 2017: Membrane Computing pp 167–182Cite as

Generalized P Colony Automata and Their Relation to P Automata

  • Conference paper
  • First Online:

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

Abstract

We investigate genPCol automata with input mappings that can be realized through the application of finite transducers to the string representations of multisets. We show that using unrestricted programs, these automata characterize the class of recursively enumerable languages. The same holds for systems with all-tape programs, having capacity at least two. In the case of systems with com-tape programs, we show that they characterize language classes which are closely related to those characterized by variants of P automata.

Supported in part by project no. K 120558, implemented with the support provided from the National Research, Development and Innovation Fund of Hungary, financed under the K_16 funding scheme. Also supported by the construction EFOP-3.6.3-VEKOP-16-2017-00002, a project supported by the European Union, co-financed by the European Social Fund.

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 EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Cienciala, L., Ciencialová, L., Csuhaj-Varjú, E., Vaszil, G.: PCol automata: recognizing strings with P colonies. In: Martínez Del Amor, M.A., Păun, G., Pérez Hurtado, I., Riscos Nuñez, A. (eds.) Eighth Brainstorming Week on Membrane Computing, Sevilla, 1–5 February 2010, pp. 65–76. Fénix Editora (2010)

    Google Scholar 

  2. Cienciala, L., Ciencialová, L.: P colonies and their extensions. In: Kelemen, J., Kelemenová, A. (eds.) Computation, Cooperation, and Life. LNCS, vol. 6610, pp. 158–169. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-20000-7_13

    Chapter  Google Scholar 

  3. Cienciala, L., Ciencialová, L., Kelemenová, A.: On the number of agents in P colonies. In: Eleftherakis, G., Kefalas, P., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2007. LNCS, vol. 4860, pp. 193–208. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-77312-2_12

    Chapter  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  5. Ciencialová, L., Cienciala, L.: Variations on the theme: P colonies. In: Kolăr, D., Meduna, A. (eds.) Proceedings of the 1st International Workshop on Formal Models, pp. 27–34, Ostrava (2006)

    Google Scholar 

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

    Article  Google Scholar 

  7. Csuhaj-Varjú, E., Dassow, J., Kelemen, J., Păun, G.: Grammar Systems - A Grammatical Approach to Distribution and Cooperation. Gordon and Breach, London (1994)

    MATH  Google Scholar 

  8. Csuhaj-Varjú, E., Oswald, M., Vaszil, G.: P automata. In: Paun, G., Rozenberg, G., Salomaa, A. (eds.) The Oxford Handbook of Membrane Computing. Oxford University Press, Inc. (2010)

    Google Scholar 

  9. Csuhaj-Varjú, E., Ibarra, O.H., Vaszil, G.: On the computational complexity of P automata. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol. 3384, pp. 76–89. Springer, Heidelberg (2005). https://doi.org/10.1007/11493785_7

    Chapter  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  11. Csuhaj-Varjú, E., Margenstern, M., Vaszil, G.: P colonies with a bounded number of cells and programs. In: Hoogeboom, H.J., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2006. LNCS, vol. 4361, pp. 352–366. Springer, Heidelberg (2006). https://doi.org/10.1007/11963516_22

    Chapter  Google Scholar 

  12. Csuhaj-Varjú, E., Vaszil, G.: P automata or purely communicating accepting P systems. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 219–233. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-36490-0_14

    Chapter  Google Scholar 

  13. Csuhaj-Varjú, E., Vaszil, G.: P automata with restricted power. Int. J. Found. Comput. Sci. 25(4), 391–408 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  14. Fischer, P.: Turing machines with restricted memory access. Inf. Control 9, 231–236 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  15. Freund, R., Oswald, M.: P colonies working in the maximally parallel and in the sequential mode. In: Zaharie, D., Petcu, D., Negru, V., Jebelean, T., Ciobanu, G., Cicortas, A., Abraham, A., Paprzycki, M. (eds.) Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2005), Timisoara, Romania, 25–29 September 2005, pp. 419–426. IEEE Computer Society (2005)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  17. Kántor, K., Vaszil, G.: On the class of languages characterized by generalized P colony automata. Theoret. Comput. Sci. (to appear)

    Google Scholar 

  18. Kántor, K., Vaszil, G.: Generalized P colony automata. J. Autom. Lang. Comb. 19(1–4), 145–156 (2014)

    MathSciNet  MATH  Google Scholar 

  19. Kelemen, J., Kelemenová, A.: A grammar-theoretic treatment of multiagent systems. Cybern. Syst. 23, 621–633 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  20. Kelemen, J., Kelemenová, A., Păun, G.: 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, pp. 82–86 (2004)

    Google Scholar 

  21. Kelemenová, A.: P colonies. In: Paun, G., Rozenberg, G., Salomaa, A. (eds.) The Oxford Handbook of Membrane Computing, pp. 584–593. Oxford University Press, Inc. (2010)

    Google Scholar 

  22. Minsky, M.: Computation: Finite and Infinite Machines. Prentice Hall, Upper Saddle River (1967)

    MATH  Google Scholar 

  23. Păun, A., Păun, G.: The power of communication: P systems with symport/antiport. New Gener. Comput. 20(3), 295–306 (2002)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Faculty of Informatics, University of Debrecen, Kassai út 26, Debrecen, 4028, Hungary

    Kristóf Kántor & György Vaszil

Authors
  1. Kristóf Kántor
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. György Vaszil
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to György Vaszil .

Editor information

Editors and Affiliations

  1. University of Bradford, Bradford, United Kingdom

    Marian Gheorghe

  2. Leiden University, Leiden, The Netherlands

    Grzegorz Rozenberg

  3. Turku Centre for Computer Science, Turku, Finland

    Arto Salomaa

  4. University of Milan-Bicocca, Milan, Italy

    Claudio Zandron

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kántor, K., Vaszil, G. (2018). Generalized P Colony Automata and Their Relation to P Automata. In: Gheorghe, M., Rozenberg, G., Salomaa, A., Zandron, C. (eds) Membrane Computing. CMC 2017. Lecture Notes in Computer Science(), vol 10725. Springer, Cham. https://doi.org/10.1007/978-3-319-73359-3_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-73359-3_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-73358-6

  • Online ISBN: 978-3-319-73359-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation