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.
Cite
CITATION STYLE
Csuhaj-Varjú, E., & Verlan, S. (2018). Computationally complete generalized communicating P systems with three cells. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10725 LNCS, pp. 118–128). Springer Verlag. https://doi.org/10.1007/978-3-319-73359-3_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
