On the Chomsky and Stanley's homomorphic characterization of context-free languages

DOI10.1016/0304-3975(85)90034-9zbMath0601.68052OpenAlexW1978773060WikidataQ123012420 ScholiaQ123012420MaRDI QIDQ1081310

Sadaki Hirose, Masaaki Yoneda

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90034-9

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• A homomorphic characterization of recursively enumerable languages
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Chomsky and Stanley's homomorphic characterization of context-free languages