Abstract
Matrix insertion-deletion systems combine the idea of matrix control (as established in regulated rewriting) with that of insertion and deletion (as opposed to replacements). We improve on and complement previous computational completeness results for such systems, showing (for instance) that matrix insertion-deletion systems with matrices of length two, insertion rules of type (1, 1, 1) and context-free deletions are computationally complete. We also show how to simulate (Kleene stars of) metalinear languages with several types of systems with very limited resources. We also generate non-semilinear languages using matrices of length three with context-free insertion and deletion rules.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alhazov, A., Krassovitskiy, A., Rogozhin, Y., Verlan, S.: P systems with minimal insertion and deletion. Theor. Comput. Sci. 412(1–2), 136–144 (2011)
Benne, R. (ed.): RNA Editing: The Alteration of Protein Coding Sequences of RNA. Molecular Biology. Ellis Horwood, Chichester (1993)
Biegler, F., Burrell, M.J., Daley, M.: Regulated RNA rewriting: modelling RNA editing with guided insertion. Theor. Comput. Sci. 387(2), 103–112 (2007)
Fernau, N.: Nonterminal complexity of programmed grammars. Theor. Comput. Sci. 296, 225–251 (2003)
Fernau, H., Freund, R., Oswald, M., Reinhardt, K.: Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars. J. Automata Lang. Comb. 12(1/2), 117–138 (2007)
Fernau, H., Kuppusamy, L.: Parikh images of matrix ins-del systems. In: Cai, J.-Y., Cui, J., Sun, X. (eds.) TAMC 2016. LNCS. Springer, Heidelberg (2016)
Fernau, H., Kuppusamy, L., Raman, I.: Descriptional complexity of graph-controlled insertion-deletion systems. In: Câmpeanu, C., Manea, F., Shallit, J.O. (eds.) DCFS 2016. LNCS, vol. 9777, pp. 111–125. Springer, Heidelberg (2016)
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, vol. 31. EPTCS, pp. 88–98 (2010)
Freund, R., Păun, G.: On the number of non-terminal symbols in graph-controlled, programmed and matrix grammars. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol. 2055, pp. 214–225. Springer, Heidelberg (2001)
Galiukschov, B.S.: Semicontextual grammars (in Russian). Mat. logica i mat. ling., Kalinin Univ., pp. 38–50 (1981)
Geffert, V.: How to generate languages using only two pairs of parentheses. J. Inf. Process. Cybern. EIK 27((5/6)), 303–315 (1991)
Hopcroft, J.E., Pansiot, J.-J.: On the reachability problem for 5-Dimensional vector addition systems. Theor. Comput. Sci. 8, 135–159 (1979)
Ivanov, S., Verlan, S.: Universality of graph-controlled leftist insertion-deletion systems with two states. In: Durand-Lose, J., Nagy, B. (eds.) MCU 2015. LNCS, vol. 9288, pp. 79–93. Springer, Heidelberg (2015)
Kari, L.: On insertion and deletion in formal languages. PhD thesis, University of Turku, Finland (1991)
Kari, L., Thierrin, G.: Contextual insertions/deletions and computability. Inf. Comput. 131(1), 47–61 (1996)
Kuppusamy, L., Mahendran, A., Krishna, S.N.: Matrix insertion-deletion systems for bio-molecular structures. In: Natarajan, R., Ojo, A. (eds.) ICDCIT 2011. LNCS, vol. 6536, pp. 301–312. Springer, Heidelberg (2011)
Kuppusamy, L., Raman, I., Krithivasan, K.: On succinct description of certain context-free languages by ins-del and matrix ins-del systems. Int. J. Found. Comput. Sci. (2016, to appear)
Marcus, M., Păun, G.: Regulated Galiukschov semicontextual grammars. Kybernetika 26(4), 316–326 (1990)
Marcus, S.: Contextual grammars. Revue Roumaine de Mathématiques Pures et Appliquées 14, 1525–1534 (1969)
Margenstern, M., Păun, G., Rogozhin, Y., Verlan, S.: Context-free insertion-deletion systems. Theor. Comput. Sci. 330(2), 339–348 (2005)
Martín-Vide, C., Păun, G., Salomaa, A.: Characterizations of recursively enumerable languages by means of insertion grammars. Theor. Comput. Sci. 205(1–2), 195–205 (1998)
Michaelis, J., Kracht, M.: Semilinearity as a syntactic invariant. In: Retoré, C. (ed.) LACL 1996. LNCS (LNAI), vol. 1328, pp. 329–345. Springer, Heidelberg (1997)
Parikh, R.J.: On context-free languages. J. ACM 13(4), 570–581 (1966)
Penttonen, M.: One-sided and two-sided context in formal grammars. Inf. Control (now Inf. Comput.) 25, 371–392 (1974)
Petre, I., Verlan, S.: Matrix insertion-deletion systems. Theor. Comput. Sci. 456, 80–88 (2012)
Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (1998)
Stabler, E.: Varieties of crossing dependencies: structure dependence and mild context sensitivity. Cogn. Sci. 28, 699–720 (2004)
Verlan, S.: Recent developments on insertion-deletion systems. Comput. Sci. J. Moldova 18(2), 210–245 (2010)
Acknowledgements
The second author acknowledges the project SR/S3/EECE/054/2010, Department of Science and Technology, New Delhi, India, for setting the platform to work in this domain.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Fernau, H., Kuppusamy, L., Raman, I. (2016). Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion. In: Amos, M., CONDON, A. (eds) Unconventional Computation and Natural Computation. UCNC 2016. Lecture Notes in Computer Science(), vol 9726. Springer, Cham. https://doi.org/10.1007/978-3-319-41312-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-41312-9_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-41311-2
Online ISBN: 978-3-319-41312-9
eBook Packages: Computer ScienceComputer Science (R0)