On the impossibility of the homomorphic characterization of context- sensitive languages

DOI10.1016/0304-3975(86)90119-2zbMath0609.68049OpenAlexW2076100617WikidataQ121832284 ScholiaQ121832284MaRDI QIDQ1087019

Masaaki Yoneda, Satoshi Okawa, Sadaki Hirose

Publication date: 1986

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90119-2

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

\(\mathcal{L}\)-reduction computation revisited ⋮ REPRESENTATIONS AND CHARACTERIZATIONS OF LANGUAGES IN CHOMSKY HIERARCHY BY MEANS OF INSERTION-DELETION SYSTEMS

Cites Work

• Left universal context-free grammars and homomorphic characterizations of languages
• Unnamed Item
• Unnamed Item

This page was built for publication: On the impossibility of the homomorphic characterization of context- sensitive languages