Abstract
Generalized communicating P systems are particular variants of networks of cells where each rule moves only two objects. In this paper we show that GCPSs with three cells and with only join, or only split, or only chain rules are computationally complete computing devices. These bounds are improvements of the previous results.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Balaskó, Á., Csuhaj-Varjú, E., Vaszil, G.: Dynamically changing environment for generalized communicating P systems. In: Rozenberg, G., Salomaa, A., Sempere, J.M., Zandron, C. (eds.) CMC 2015. LNCS, vol. 9504, pp. 92–105. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-28475-0_7
Csuhaj-Varjú, E., Vaszil, G., Verlan, S.: On generalized communicating P systems with one symbol. In: Gheorghe, M., Hinze, T., Păun, G., Rozenberg, G., Salomaa, A. (eds.) CMC 2010. LNCS, vol. 6501, pp. 160–174. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-18123-8_14
Csuhaj-Varjú, E., Verlan, S.: On generalized communicating P systems with minimal interaction rules. Theor. Comput. Sci. 412, 124–135 (2011)
Freund, R., Verlan, S.: A formal framework for static (tissue) P systems. In: Eleftherakis, G., Kefalas, P., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2007. LNCS, vol. 4860, pp. 271–284. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-77312-2_17
Krishna, S.N., Gheorghe, M., Dragomir, C.: Some classes of generalised communicating P systems and simple kernel P systems. Technical report, CS-12-03, University of Sheffield (2013). http://staffwww.dcs.shef.ac.uk/people/M.Gheorghe/research/paperlist.html
Krishna, S.N., Gheorghe, M., Dragomir, C.: Some classes of generalised communicating P systems and simple kernel P systems. In: Bonizzoni, P., Brattka, V., Löwe, B. (eds.) CiE 2013. LNCS, vol. 7921, pp. 284–293. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-39053-1_33
Krishna, S.N., Gheorghe, M., Ipate, F., Csuhaj-Varjú, E., Ceterchi, R.: Further results on generalised communicating P systems. Theor. Comput. Sci. (2017, in press). https://doi.org/10.1016/j.tcs.2017.05.020
Minsky, M.: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs (1967)
Păun, G., Rozenberg, G., Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing. Oxford University Press, Oxford (2010)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 1–3. Springer, Heidelberg (1997). https://doi.org/10.1007/978-3-642-59136-5
Verlan, S., Bernardini, F., Gheorghe, M., Margenstern, M.: Computational completeness of tissue P systems with conditional uniport. In: Hoogeboom, H.J., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2006. LNCS, vol. 4361, pp. 521–535. Springer, Heidelberg (2006). https://doi.org/10.1007/11963516_33
Verlan, S., Bernardini, F., Gheorghe, M., Margenstern, M.: Generalized communicating P systems. Theor. Comput. Sci. 404(1–2), 170–184 (2008)
Acknowledgment
The work of E. CS-V. was supported by the National Research, Development, and Innovation Office - NKFIH, Hungary, Grant no. K 120558.
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
Csuhaj-Varjú, E., Verlan, S. (2018). Computationally Complete Generalized Communicating P Systems with Three Cells. 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_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-73359-3_8
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)