Morphic characterizations of languages in Chomsky hierarchy with insertion and locality

DOI10.1016/J.IC.2010.11.011zbMath1227.68055OpenAlexW2002565773MaRDI QIDQ553307

Kaoru Fujioka

Publication date: 27 July 2011

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2324/25741

zbMATH Keywords

insertion systemstrictly locally testable language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Splicing representations of stricly locally testable languages
• 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
• New Morphic Characterizations of Languages in Chomsky Hierarchy Using Insertion and Locality

This page was built for publication: Morphic characterizations of languages in Chomsky hierarchy with insertion and locality