Skip to main content

Parikh Images of Matrix Ins-Del Systems

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10185))

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Benne, R. (ed.): RNA Editing: The Alteration of Protein Coding Sequences of RNA. Series in Molecular Biology. Ellis Horwood, Chichester (1993)

    Google Scholar 

  2. Dassow, J., Păun, G.: Regulated rewriting in formal language theory. In: EATCS Monographs in Theoretical Computer Science, vol. 18. Springer, Heidelberg (1989)

    Google Scholar 

  3. Fernau, H.: An essay on general grammars. J. Automata Lang. Comb. 21, 69–92 (2016)

    MathSciNet  MATH  Google Scholar 

  4. 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

    Google Scholar 

  5. 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)

    Google Scholar 

  6. Hauschildt, D., Jantzen, M.: Petri net algorithms in the theory of matrix grammars. Acta Informatica 31, 719–728 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  7. Hopcroft, J.E., Pansiot, J.-J.: On the reachability problem for 5-dimensional vector addition systems. Theor. Comput. Sci. 8, 135–159 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kari, L., Thierrin, G.: Contextual insertions/deletions and computability. Inf. Comput. 131(1), 47–61 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  9. 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

    Chapter  Google Scholar 

  10. 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)

    Article  MathSciNet  MATH  Google Scholar 

  11. Margenstern, M., Păun, G., Rogozhin, Y., Verlan, S.: Context-free insertion-deletion systems. Theor. Comput. Sci. 330(2), 339–348 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  12. Parikh, R.J.: On context-free languages. J. ACM 13(4), 570–581 (1966)

    Google Scholar 

  13. Petre, I., Verlan, S.: Matrix insertion-deletion systems. Theor. Comput. Sci. 456, 80–88 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  14. Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer, Heidelberg (1998)

    Google Scholar 

  15. Reinhardt, K.: Counting as Method, Model and Task in Theoretical Computer Science. Habilitationsschrift, Universität Tübingen (2005)

    Google Scholar 

  16. 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)

    Google Scholar 

  17. Suzuki, Y., Tanaka, H.: Symbolic chemical system based on abstract rewriting system and its behavior pattern. Artif. Life Robot. 1(4), 211–219 (1997)

    Article  Google Scholar 

  18. Verlan, S.: On minimal context-free insertion-deletion systems. J. Automata Lang. Comb. 12(1–2), 317–328 (2007)

    Google Scholar 

  19. Verlan, S.: Recent developments on insertion-deletion systems. Comput. Sci. J. Moldova 18(2), 210–245 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Henning Fernau .

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics