MORPHIC CHARACTERIZATIONS OF LANGUAGE FAMILIES IN TERMS OF INSERTION SYSTEMS AND STAR LANGUAGES

DOI10.1142/S012905411100799XzbMath1213.68351MaRDI QIDQ3076617

Takashi Yokomori, Fumiya Okubo

Publication date: 23 February 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

star languagesmorphic characterizationinsertion systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (3)

\(\mathcal{L}\)-reduction computation revisited ⋮ On the computing powers of \(\mathcal{L}\)-reductions of insertion languages ⋮ Universal insertion grammars of size two

Cites Work

• On the weight of universal insertion grammars
• Characterizations of recursively enumerable languages by means of insertion grammars
• Context-free insertion-deletion systems
• REPRESENTATIONS AND CHARACTERIZATIONS OF LANGUAGES IN CHOMSKY HIERARCHY BY MEANS OF INSERTION-DELETION SYSTEMS

This page was built for publication: MORPHIC CHARACTERIZATIONS OF LANGUAGE FAMILIES IN TERMS OF INSERTION SYSTEMS AND STAR LANGUAGES