Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion Systems
A graph-controlled insertion-deletion (GCID) system is a regulated extension of an insertion-deletion system. It has several components and each component contains some insertion-deletion rules. These components are the vertices of a directed control graph. A rule is applied to a string in a component and the resultant string is moved to the target component specified in the rule, describing the arcs of the control graph. We investigate which combinations of size parameters (the maximum number of components, the maximal length of the insertion string, the maximal length of the left context for insertion, the maximal length of the right context for insertion; a similar three restrictions with respect to deletion) are sufficient to maintain the computational completeness of such restricted systems with the additional restriction that the control graph is a path, thus, these results also hold for ins-del P systems.
KeywordsGraph-controlled ins-del systems Path-structured control graph Computational completeness Descriptional complexity measures
This work was supported by overhead money from the DFG grant FE 560/6-1.
- 1.Benne, R. (ed.): RNA Editing: The Alteration of Protein Coding Sequences of RNA. Molecular Biology. Ellis Horwood, Chichester (1993)Google Scholar
- 4.Fernau, H., Kuppusamy, L., Raman, I.: Generative power of graph-controlled ins-del systems with small sizes. Accepted with J. Automata Lang. Comb. (2017)Google Scholar
- 5.Fernau, H., Kuppusamy, L., Raman, I.: On the computational completeness of graph-controlled insertion-deletion systems with binary sizes. Accepted with Theor. Comput. Sci. (2017). http://dx.doi.org/10.1016/j.tcs.2017.01.019
- 6.Freund, R., Kogler, M., Rogozhin, Y., Verlan, S.: Graph-controlled insertion-deletion systems. In: McQuillan, I., Pighizzini, G. (eds.) Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, DCFS. EPTCS, vol. 31, pp. 88–98 (2010)Google Scholar
- 13.Păun, Gh.: Membrane Computing: An Introduction. Springer, Heidelberg (2002)Google Scholar
- 14.Păun, Gh., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer, Heidelberg (1998)Google Scholar