n-Insertion on Languages

  • Masami Ito
  • Ryo Sugiura
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2950)


In this paper, we define the n-insertion A ⊳ [n] B of a language A into a language B and provide some properties of n-insertions. For instance, the n-insertion of a regular language into a regular language is regular but the n-insertion of a context-free language into a context-free language is not always context-free. However, it can be shown that the n-insertion of a regular (context-free) language into a context-free (regular) language is context-free. We also consider the decomposition of regular languages under n-insertion.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Câmpeanu, C., Salomaa, K., Vágvölgyi, S.: Shuffle quotient and decompositions. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol. 2295, pp. 186–196. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  2. 2.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)zbMATHGoogle Scholar
  3. 3.
    Ito, M.: Shuffle decomposition of regular languages. Journal of Universal Computer Science 8, 257–259 (2002)Google Scholar
  4. 4.
    Kari, L.: On insertion and deletion in formal languages, PhD thesis, University of Turku (1991)Google Scholar
  5. 5.
    Kari, L., Păun, G., Thierrin, G., Yu, S.: At the crossroads of DNA computing and formal languages: Characterizing RE using insertion-deletion systems. In: Prof. 3rd DIMACS Workshop on DNA Based Computers, Philadelphia, pp. 318–333 (1997)Google Scholar
  6. 6.
    Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing. New Computing Paradigms. Springer, Berlin (1998)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Masami Ito
    • 1
  • Ryo Sugiura
    • 1
  1. 1.Faculty of ScienceKyoto Sangyo UniversityKyotoJapan

Personalised recommendations