Representations and Characterizations of Languages in Chomsky Hierarchy by Means of Insertion-Deletion Systems

Insertion-deletion operations are much investigated in linguistics and in DNA computing and several characterizations of Turing computability and characterizations or representations of languages in Chomsky hierarchy were obtained in this framework. In this note we contribute to this research direction with a new characterization of this type, as well as with representations of regular and context-free languages, mainly starting from context-free insertion systems of as small as possible complexity. For instance, each recursively enumerable language L can be represented in a way similar to the celebrated Chomsky-Schutzenberger representation of context-free languages, i.e., in the form L = h(L(γ) ∩ D), where γ is an insertion system of weight (3, 0) (at most three symbols are inserted in a context of length zero), h is a projection, and D is a Dyck language. A similar representation can be obtained for regular languages, involving insertion systems of weight (2,0) and star languages, as well as for context-free languages – this time using insertion systems of weight (3, 0) and star languages.

[1]  Sergey Verlan,et al.  On minimal context-free insertion-deletion systems , 2005, DCFS.

[2]  Solomon Marcus,et al.  Contextual Grammars , 1969, COLING.

[3]  Arto Salomaa.  On a homomorphic characterization of recursively enumerable languages , 1973 .

[4]  Gheorghe Paun,et al.  Context-free insertion-deletion systems , 2005, Theor. Comput. Sci..

[5]  Gheorghe Paun,et al.  DNA Computing: New Computing Paradigms , 1998 .

[6]  Onodera Kaoru.  A Note on Homomorphic Representation of Recursively Enumerable Languages with Insertion Grammars , 2003 .

[7]  Takashi Yokomori,et al.  On the Computational Power of Insertion-Deletion Systems , 2002, DNA.

[8]  Gheorghe Paun,et al.  Marcus Contextual Grammars , 1994, Bull. EATCS.

[9]  榊原 康文,et al.  G. Paun, G. Rozenberg and A. Salomaa : "DNA Computing-New Computing Paradigms", Springer-Verlag (1998) , 2000 .

[10]  Masaaki Yoneda,et al.  A Homomorphic Characterization of Recursively Enumerable Languages , 1985, Theor. Comput. Sci..

[11]  Brenda S. Baker,et al.  Reversal-Bounded Multipushdown Machines , 1974, J. Comput. Syst. Sci..

[12]  Lila Kari,et al.  Contextual Insertions/Deletions and Computability , 1996, Inf. Comput..

[13]  Masaaki Yoneda,et al.  On the Impossibility of the Homomorphic Characterization of Context-Sensitive Languages , 1986, Theor. Comput. Sci..

[14]  Carlos Martín-Vide,et al.  Characterizations of Recursively Enumerable Languages by Means of Insertion Grammars , 1998, Theor. Comput. Sci..