Learning Local Languages and Their Application to DNA Sequence Analysis
IEEE Transactions on Pattern Analysis and Machine Intelligence
Characterizations of recursively enumerable languages by means of insertion grammars
Theoretical Computer Science
Handbook of Formal Languages
Context-free insertion-deletion systems
Theoretical Computer Science - Descriptional complexity of formal systems
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
New Morphic Characterizations of Languages in Chomsky Hierarchy Using Insertion and Locality
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Morphic characterizations in terms of insertion systems with a context of length one
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Morphic characterizations with insertion systems controlled by a context of length one
Theoretical Computer Science
| Hi-index | 0.00 |
This paper concerns new characterizations of regular, context-free, and recursively enumerable languages, using insertion systems with lower complexity. This is achieved by using both strictly locally testable languages and morphisms. The representation is in a similar way to the Chomsky-Schu@?tzenberger representation of context-free languages. Specifically, each recursively enumerable language L can be represented in the form L=h(L(@c)@?R), where @c is an insertion system of weight (3,3), R is a strictly 2-testable language, and h is a projection. A similar representation can be obtained for context-free languages, using insertion systems of weight (2,0) and strictly 2-testable languages, as well as for regular languages, using insertion systems of weight (1,0) and strictly 2-testable languages.