Abstract
P systems, introduced by Gh. Pǎaun, form a new class of distributed computing models. Many variants of P systems were shown to be computationally universal. In this paper, we consider several classes of P systems with symbol-objects where we allow the catalysts to move in and out of a membrane. We prove universality results for these variants of P systems with a very small number of membranes. © 2001 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Mutyam, M., & Krithivasan, K. (2001). Universality results for some variants of P systems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2235, 237–253. https://doi.org/10.1007/3-540-45523-x_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
