Morphic Characterizations in Terms of Insertion Systems with a Context of Length One

  • Kaoru Fujioka
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6795)


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.


  1. 1.
    Fujioka, K.: Morphic characterizations of languages in chomsky hierarchy with insertion and locality. Inf. Comput. 209(3), 397–408 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    McNaughton, R., Papert, S.A.: Counter-Free Automata (M.I.T. research monograph), vol. (65). The MIT Press, Cambridge (1971)zbMATHGoogle Scholar
  3. 3.
    Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing. In: New Computing Paradigms. Springer, Heidelberg (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Kaoru Fujioka
    • 1
  1. 1.Office for Strategic Research PlanningKyushu UniversityHigashi-kuJapan

Personalised recommendations