Morphic Characterizations of Language Families in Terms of Insertion Systems and Star Languages

  title={Morphic Characterizations of Language Families in Terms of Insertion Systems and Star Languages},
  author={Fumiya Okubo and Takashi Yokomori},
  journal={Int. J. Found. Comput. Sci.},
Insertion systems have a unique feature in that only string insertions are allowed, which is in marked contrast to a variety of the conventional computing devices based on string rewriting. This paper will mainly focus on those systems whose insertion operations are performed in a context-free fashion, called context-free insertion systems, and obtain several characterizations of language families with the help of other primitive languages (like star languages) as well as simple operations… 

Figures from this paper

Morphic Characterizations with Insertion and Locality in the Framework of Chomsky-Schützenberger Theorem

This work obtains 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.



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

A new characterization of insertion-deletion operations in linguistics and in DNA computing is contributed with a new representation 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.

Characterizations of Recursively Enumerable Languages by Means of Insertion Grammars

New Morphic Characterizations of Languages in Chomsky Hierarchy Using Insertion and Locality

Some characterizations and representation theorems of languages in Chomsky hierarchy are obtained by using insertion systems, strictly locally testable languages, and morphisms.

Refinement of Representation Theorems for Context-Free Languages

  • Kaoru Fujioka
  • Computer Science, Linguistics
    IEICE Trans. Inf. Syst.
  • 2010
The Chomsky-Schutzenberger representation theorem is improved and it is shown that each context-free language L can be represented in the form L = h (D ∩ R), where D is a Dyck language, R is a strictly 3-testable language, and h is a morphism.

Counter-Free Automata

A particular class of finite-state automata, christened by the authors "counter-free," is shown here to behave like a good actor: it can drape itself so thoroughly in the notational guise and embed

On minimal context-free insertion-deletion systems

It is shown that if the length of the inserted/deleted string is bounded to two, then the obtained systems are not universal and a new complexity measure is introduced for insertion-deletion systems, which permits a better explanation of the obtained results.

On the weight of universal insertion grammars

Handbook of Formal Languages

This first handbook of formal languages gives a comprehensive up-to-date coverage of all important aspects and subareas of the field.

Marcus Contextual Grammars

  • G. Paun
  • Linguistics, Computer Science
    Bull. EATCS
  • 1994
1. Origin and Motivation, Formal Language Theory Prerequisites, and A Generalization: n-Contextual Grammars.