Homomorphic characterizations of recursively enumerable languages with very small language classes

DOI10.1016/S0304-3975(99)00110-3zbMath0952.68075WikidataQ123314526 ScholiaQ123314526MaRDI QIDQ1589418

Sadaki Hirose, Satoshi Okawa

Publication date: 12 December 2000

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

zbMATH Keywords

formal language theoryhomomorphic characterization

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• A homomorphic characterization of recursively enumerable languages
• Reversal-bounded multipushdown machines
• The decidability of equivalence for a family of linear grammars
• On a family of linear grammars
• One-way stack automata
• Generalizations of regular events

This page was built for publication: Homomorphic characterizations of recursively enumerable languages with very small language classes