On path-controlled insertion–deletion systems
- 160 Downloads
A graph-controlled insertion–deletion 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 transition is performed by any applicable rule in the current component on a string and the resultant string is then moved to the target component specified in the rule. This also describes the arcs of the control graph. Starting from an axiom in the initial component, strings thus move through the control graph. The language of the system is the set of all terminal strings collected in the final component. In this paper, we investigate a variant of the main question in this area: 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; plus three similar restrictions with respect to deletion) are sufficient to maintain computational completeness of such restricted systems under the additional restriction that the (undirected) control graph is a path? Notice that these results also bear consequences for the domain of insertion–deletion P systems, improving on a number of previous results from the literature, concerning in particular the number of components (membranes) that are necessary for computational completeness results.
Some part of the work done by the second author was during his visit to University of Trier, Germany, in December 2016. The possibility to use some overhead money from the DFG Grant FE 560/6-1 to finance this visit is gratefully acknowledged.
- 3.Benne, R. (ed.): RNA Editing: The Alteration of Protein Coding Sequences of RNA. Series in Molecular Biology. Ellis Horwood, Chichester (1993)Google Scholar
- 8.Fernau, H., Kuppusamy, L., Raman, I.: Computational completeness of path-structured graph-controlled insertion-deletion systems. In: Carayol, A., Nicaud, C. (eds.) Implementation and Application of Automata–22nd International Conference, CIAA, LNCS, vol. 10329, pp. 89–100. Springer, Berlin (2017)Google Scholar
- 9.Fernau, H., Kuppusamy, L., Raman, I.: Graph-controlled insertion-deletion systems generating language classes beyond linearity. In: Pighizzini, G., Câmpeanu, C. (eds.) Descriptional Complexity of Formal Systems–19th IFIP WG 102 International Conference, DCFS, LNCS, vol. 10316, pp. 128–139. Springer, Berlin (2017)CrossRefGoogle Scholar
- 10.Fernau, H., Kuppusamy, L., Raman, I.: Investigations on the power of matrix insertion-deletion systems with small sizes. Natl. Comput. (accepted) (2017)Google Scholar
- 13.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
- 16.Ivanov, S., Verlan, S.: About one-sided one-symbol insertion-deletion P systems. In: Alhazov, A., Cojocaru, S., Gheorghe, M., Rogozhin, Y., Rozenberg, G., Salomaa, A. (eds.) Membrane Computing—14th International Conference, CMC 2013, LNCS, vol. 8340, pp. 225–237. Springer, Berlin (2014)Google Scholar
- 18.Kari, L.: On insertion and deletion in formal languages. Ph.D. thesis, University of Turku, Finland (1991)Google Scholar
- 19.Kari, L., Păun, Gh., Thierrin, G., Yu, S.: At the crossroads of DNA computing and formal languages: characterizing recursively enumerable languages using insertion-deletion systems. In: Rubin, H., Wood, D.H. (eds.) DNA Based Computers III, DIMACS Series in Discrete Mathematics and Theretical Computer Science, vol. 48, pp. 329–338 (1999)Google Scholar
- 21.Krassovitskiy, A., Rogozhin, Y., Verlan, S.: Further results on insertion-deletion systems with one-sided contexts. In: Martín-Vide, C., Otto, F., Fernau, H. (eds.) Language and Automata Theory and Applications, Second International Conference, LATA, LNCS, vol. 5196, pp. 333–344. Springer, Berlin (2008)CrossRefGoogle Scholar
- 23.Krishna, S.N., Rama, R.: Insertion-deletion P systems. In: Jonoska, N., Seeman, N.C. (eds.) DNA Computing, 7th International Workshop on DNA-Based Computers, 2001, Revised Papers, LNCS, vol. 2340, pp. 360–370. Springer, Berlin (2002)Google Scholar
- 24.Kuppusamy, L., Mahendran, A., Krishna, S.N.: Matrix insertion-deletion systems for bio-molecular structures. In: Natarajan, R., Ojo, A.K. (eds.) Distributed Computing and Internet Technology–7th International Conference, ICDCIT, LNCS, vol. 6536, pp. 301–312. Springer, Berlin (2011)CrossRefGoogle Scholar
- 25.Kuppusamy, L., Rama, R.: On the power of tissue P systems with insertion and deletion rules. In: Pre-Proceedings of Workshop on Membrane Computing, Report RGML, vol. 28, pp. 304–318. Univ. Tarragona, Spain (2003)Google Scholar