Abstract
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.
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
Preview
Unable to display preview. Download preview PDF.
References
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)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)
Ito, M.: Shuffle decomposition of regular languages. Journal of Universal Computer Science 8, 257–259 (2002)
Kari, L.: On insertion and deletion in formal languages, PhD thesis, University of Turku (1991)
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)
Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing. New Computing Paradigms. Springer, Berlin (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ito, M., Sugiura, R. (2003). n-Insertion on Languages. In: Jonoska, N., Păun, G., Rozenberg, G. (eds) Aspects of Molecular Computing. Lecture Notes in Computer Science, vol 2950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24635-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-24635-0_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20781-8
Online ISBN: 978-3-540-24635-0
eBook Packages: Springer Book Archive