Skip to main content
SpringerLink
Log in

On describing super-linear languages by matrix insertion–deletion systems

  • Published:
International Journal of Advances in Engineering Sciences and Applied Mathematics Aims and scope Submit manuscript

Abstract

Matrix insertion–deletion (matrix ins–del) systems combine the idea of matrix control (as established in regulated rewriting) with that of insertion and deletion operations (as opposed to replacements). There are matrix ins–del systems of small sizes that are known to describe linear languages but not even context-free languages. Our aim is to study the generative power of such matrix ins–del systems. In this regard, we consider six language classes, called super-linear languages between LIN and CFL, namely \({\mathrm {CLIN}}\), \({\mathrm {SLIN}}\), \({\mathrm {CSLIN}}\), \({\mathrm {SCLIN}}\), \({\mathrm {CSCLIN}}\) and \({\mathrm {SCSLIN}}\) obtained by applying concatenation or/and Kleene closure operation on linear languages. These classes deserve special attention due to the fact that \({\mathrm {LIN}}\) is closed neither under concatenation nor under Kleene closure. In this paper, we discuss the context-free grammars that generate these language classes and also simulate them by matrix ins–del systems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

Notes

  1. As per the notations used in this paper, metalinear language class is \({\mathcal {L}}_{\cup } ({\mathcal {L}}_{\circ }({\mathrm {LIN}}))\).

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. Biegler, F., Burrell, M.J., Daley, M.: Regulated RNA rewriting: modelling RNA editing with guided insertion. Theor. Comput. Sci. 387(2), 103–112 (2007)

    Article  MathSciNet  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  4. Marcus, S.: Contextual grammars. Rev. Roum. Math. Pures Appl. 14, 1525–1534 (1969)

    MathSciNet  MATH  Google Scholar 

  5. Galiukschov, B.S.: Semicontextual Grammars (in Russian). Mat. logica i mat. ling., Kalinin Univ., pp. 38–50 (1981)

  6. Kari, L.: On insertion and deletion in formal languages. Ph.D. Thesis, University of Turku, Finland (1991)

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Alhazov, A., Krassovitskiy, A., Rogozhin, Y., Verlan, S.: P systems with minimal insertion and deletion. Theor. Comput. Sci. 412(1–2), 136–144 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  9. Kuppusamy, L., Rama, R.: On the power of tissue P systems with insertion and deletion rules. Pre-Proceedings of Workshop on Membrane Computing, Volume 28 of Report RGML, pp. 304–318. Univ. Tarragona, Spain (2003)

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

  11. Fernau, H., Kuppusamy, L., Raman, I.: Descriptional complexity of graph-controlled insertion–deletion systems. In: Câmpeanu, C., Manea, F., Shallit, J.O. (eds.) 18th International Conference on Descriptional Complexity of Formal Systems, DCFS, Volume 9777 of LNCS, pp. 111–125. Springer (2016)

  12. Freund, R., Kogler, M., Rogozhin, Y., Verlan, S.: Graph-controlled insertion–deletion systems. In: McQuillan, I., Pighizzini, G. (eds.) Proceedings 12th Annual Workshop on Descriptional Complexity of Formal Systems, DCFS, Volume 31 of EPTCS, pp. 88–98 (2010)

  13. Ivanov, S., Verlan, S.: Universality of graph-controlled leftist insertion–deletion systems with two states. In: Durand-Lose, J., Nagy, B. (eds.) Machines, Computations, and Universality—7th International Conference, MCU, Volume 9288 of LNCS, pp. 79–93. Springer (2015)

  14. Kuppusamy, L., Mahendran, A.: Modelling DNA and RNA secondary structures using matrix insertion–deletion systems. Int. J. Appl. Math. Comput. Sci. 26(1), 245–258 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  15. 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, Volume 6536 of LNCS, pp. 301–312. Springer (2011)

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

    Article  MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  18. Julie, J., Babujee, B., Masilamani, V.: Dissecting power of certain matrix languages. ICTCSDM, pp. 98–105 (2016)

  19. Kuppusamy, L., Mahendran, A., Krishna, S.N.: On representing natural languages and bio-molecular structures using matrix insertion–deletion systems and its computational completeness. In: Bel-Enguix, G., Dahl, V., Ortega de la Puente, A. (eds.) Proceedings of the 1st International Workshop on AI Methods for Interdisciplinary Research in Language and Biology (ICAART 2011), pp. 47–56. Science and Technology Publications (2011)

  20. 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. 27(7), 775–786 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  21. Fernau, H., Kuppusamy, L., Raman, I.: Investigations on the power of matrix insertion–deletion systems with small sizes. Nat. Comput. 17(2), 249–269 (2018)

    Article  MathSciNet  Google Scholar 

  22. 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.) Unconventional Computation and Natural Computation Conference, UCNC, Volume 9726 of LNCS, pp. 35–48. Springer (2016)

  23. Stabler, E.: Varieties of crossing dependencies: structure dependence and mild context sensitivity. Cogn. Sci. 28, 699–720 (2004)

    Article  Google Scholar 

  24. Kutrib, M., Malcher, A.: Finite turns and the regular closure of linear context-free languages. Discrete Appl. Math. 155(16), 2152–2164 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  25. Yntema, M.K.: Cap expressions for context-free languages. Inf. Control (Inf. Comput.) 18(4), 311–318 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  26. Fernau, H.: Nonterminal complexity of programmed grammars. Theor. Comput. Sci. 296, 225–251 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  27. Fernau, H., Freund, R., Oswald, M., Reinhardt, K.: Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars. J. Autom. Lang. Comb. 12(1/2), 117–138 (2007)

    MathSciNet  MATH  Google Scholar 

  28. 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.) Machines, Computations, and Universality; 3rd MCU, Volume 2055 of LNCS, pp. 214–225 (2001)

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics and Computational Sciences, PSG College of Technology, Coimbatore, 641 004, India

    Indhumathi Raman

  2. School of Computer Science and Engineering, VIT, Vellore, 632 014, India

    Lakshmanan Kuppusamy

Authors
  1. Indhumathi Raman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lakshmanan Kuppusamy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lakshmanan Kuppusamy.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Raman, I., Kuppusamy, L. On describing super-linear languages by matrix insertion–deletion systems. Int J Adv Eng Sci Appl Math 11, 11–24 (2019). https://doi.org/10.1007/s12572-019-00246-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12572-019-00246-5

Keywords

Search

Navigation