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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
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)
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
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
Cienciala, L., Ciencialová, L., Kelemenová, A.: Homogeneous P colonies. Comput. Inform. 27(3+), 481–496 (2008)
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)
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)
Csuhaj-Varjú, E., Dassow, J., Kelemen, J., Păun, G.: Grammar Systems - A Grammatical Approach to Distribution and Cooperation. Gordon and Breach, London (1994)
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)
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
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)
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
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
Csuhaj-Varjú, E., Vaszil, G.: P automata with restricted power. Int. J. Found. Comput. Sci. 25(4), 391–408 (2014)
Fischer, P.: Turing machines with restricted memory access. Inf. Control 9, 231–236 (1966)
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)
Freund, R., Oswald, M.: P colonies and prescribed teams. Int. J. Comput. Math. 83(7), 569–592 (2006)
Kántor, K., Vaszil, G.: On the class of languages characterized by generalized P colony automata. Theoret. Comput. Sci. (to appear)
Kántor, K., Vaszil, G.: Generalized P colony automata. J. Autom. Lang. Comb. 19(1–4), 145–156 (2014)
Kelemen, J., Kelemenová, A.: A grammar-theoretic treatment of multiagent systems. Cybern. Syst. 23, 621–633 (1992)
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)
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)
Minsky, M.: Computation: Finite and Infinite Machines. Prentice Hall, Upper Saddle River (1967)
Păun, A., Păun, G.: The power of communication: P systems with symport/antiport. New Gener. Comput. 20(3), 295–306 (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
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)