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 study families of multisets that can be described as Parikh images of languages generated by this type of systems, focusing on aspects of descriptional complexity. We show that the Parikh images of matrix insertion-deletion systems having length 2 matrices and context-free insertion/deletion contain only semilinear languages and when the matrices length increased to 3, they contain non-semilinear languages. We also characterize the hierarchy of family of languages that is formed with these systems having small sizes. We also introduce a new class, namely, monotone strict context-free matrix ins-del systems and analyze the results connecting with families of context-sensitive languages and Parikh images of regular and context-free matrix languages.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Benne, R. (ed.): RNA Editing: The Alteration of Protein Coding Sequences of RNA. Series in Molecular Biology. Ellis Horwood, Chichester (1993)
Dassow, J., Păun, G.: Regulated rewriting in formal language theory. In: EATCS Monographs in Theoretical Computer Science, vol. 18. Springer, Heidelberg (1989)
Fernau, H.: An essay on general grammars. J. Automata Lang. Comb. 21, 69–92 (2016)
Fernau, H., Kuppusamy, L., Raman, I.: Generative power of matrix insertion-deletion systems with context-free insertion or deletion. In: Amos, M., Condon, A. (eds.) UCNC 2016. LNCS, vol. 9726, pp. 35–48. Springer, Cham (2016). doi:10.1007/978-3-319-41312-9_4
Fernau, H., Kuppusamy, L., Raman, I.: Investigations on the power of matrix insertion-deletion systems with small sizes (2016, Submitted to Natural Computing) (to appear)
Hauschildt, D., Jantzen, M.: Petri net algorithms in the theory of matrix grammars. Acta Informatica 31, 719–728 (1994)
Hopcroft, J.E., Pansiot, J.-J.: On the reachability problem for 5-dimensional vector addition systems. Theor. Comput. Sci. 8, 135–159 (1979)
Kari, L., Thierrin, G.: Contextual insertions/deletions and computability. Inf. Comput. 131(1), 47–61 (1996)
Kudlek, M., Martín-Vide, C., Păun, G.: Toward a formal macroset theory. In: Calude, C.S., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMP 2000. LNCS, vol. 2235, pp. 123–133. Springer, Heidelberg (2001). doi:10.1007/3-540-45523-X_7
Kuppusamy, L., Mahendran, A.: Modelling DNA and RNA secondary structures using matrix insertion-deletion systems. Intl. J. Appl. Math. Comput. Sci. 26(1), 245–258 (2016)
Margenstern, M., Păun, G., Rogozhin, Y., Verlan, S.: Context-free insertion-deletion systems. Theor. Comput. Sci. 330(2), 339–348 (2005)
Parikh, R.J.: On context-free languages. J. ACM 13(4), 570–581 (1966)
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. Springer, Heidelberg (1998)
Reinhardt, K.: Counting as Method, Model and Task in Theoretical Computer Science. Habilitationsschrift, Universität Tübingen (2005)
Smith, W.D.: DNA computers in vitro and in vivo. In: Lipton, R.J., Baum, E.B. (eds.) DNA Based Computers, Proceedings of a DIMACS Workshop, Princeton, 1995, pp. 121–186. American Mathematical Society (1996)
Suzuki, Y., Tanaka, H.: Symbolic chemical system based on abstract rewriting system and its behavior pattern. Artif. Life Robot. 1(4), 211–219 (1997)
Verlan, S.: On minimal context-free insertion-deletion systems. J. Automata Lang. Comb. 12(1–2), 317–328 (2007)
Verlan, S.: Recent developments on insertion-deletion systems. Comput. Sci. J. Moldova 18(2), 210–245 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Fernau, H., Kuppusamy, L. (2017). Parikh Images of Matrix Ins-Del Systems. In: Gopal, T., Jäger , G., Steila, S. (eds) Theory and Applications of Models of Computation. TAMC 2017. Lecture Notes in Computer Science(), vol 10185. Springer, Cham. https://doi.org/10.1007/978-3-319-55911-7_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-55911-7_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-55910-0
Online ISBN: 978-3-319-55911-7
eBook Packages: Computer ScienceComputer Science (R0)