Abstract
Representing a class of languages through operations on its subclasses is a traditional issue within formal language theory. Among the variety of representation theorems for context-free languages, Chomsky-Schützenberger theorem is unique in that it consists of Dyck languages, regular languages, and simple operations. In this work, we obtain some characterizations and representation theorems of context-free languages and regular languages in Chomsky hierarchy by insertion systems, strictly locally testable languages, and morphisms in the framework of Chomsky-Schützenberger theorem.
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
Fujioka, K.: Morphic characterizations of languages in chomsky hierarchy with insertion and locality. Inf. Comput. 209(3), 397–408 (2011)
McNaughton, R., Papert, S.A.: Counter-Free Automata (M.I.T. research monograph), vol. (65). The MIT Press, Cambridge (1971)
Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing. In: New Computing Paradigms. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fujioka, K. (2011). Morphic Characterizations in Terms of Insertion Systems with a Context of Length One. In: Mauri, G., Leporati, A. (eds) Developments in Language Theory. DLT 2011. Lecture Notes in Computer Science, vol 6795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22321-1_44
Download citation
DOI: https://doi.org/10.1007/978-3-642-22321-1_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22320-4
Online ISBN: 978-3-642-22321-1
eBook Packages: Computer ScienceComputer Science (R0)