Abstract
We consider the (d-dimensional) array counterpart of string insertion and deletion grammars and use the operations of array insertion and deletion in the framework of P systems where the applicability of the rules depends on the membrane region. In this paper, we especially focus on examples of two-dimensional array insertion and deletion P systems and show that we can already obtain computational completeness using such P systems with a membrane structure of tree height of at most two and only the targets here, in, and out. © 2013 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Fernau, H., Freund, R., Ivanov, S., Schmid, M. L., & Subramanian, K. G. (2013). Array insertion and deletion P systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7956 LNCS, pp. 67–78). Springer Verlag. https://doi.org/10.1007/978-3-642-39074-6_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
