Left universal context-free grammars and homomorphic characterizations of languages

DOI10.1016/S0019-9958(81)90170-4zbMath0493.68082WikidataQ123242140 ScholiaQ123242140MaRDI QIDQ3956428

Masakazu Nasu, Sadaki Hirose

Publication date: 1981

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

zbMATH Keywords

control languagehomomorphic characterizations of recursively enumerable and of linear languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

On the impossibility of the homomorphic characterization of context- sensitive languages ⋮ Epsilon-reducible context-free languages and characterizations of indexed languages ⋮ Even linear simple matrix languages: formal language properties and grammatical inference. ⋮ A homomorphic characterization of recursively enumerable languages

This page was built for publication: Left universal context-free grammars and homomorphic characterizations of languages