A homomorphic characterization of recursively enumerable languages
From MaRDI portal
Publication:1061494
DOI10.1016/0304-3975(85)90018-0zbMath0571.68063OpenAlexW1998759046WikidataQ121887802 ScholiaQ121887802MaRDI QIDQ1061494
Sadaki Hirose, Satoshi Okawa, 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)90018-0
Related Items (4)
On the Chomsky and Stanley's homomorphic characterization of context-free languages ⋮ REPRESENTATIONS AND CHARACTERIZATIONS OF LANGUAGES IN CHOMSKY HIERARCHY BY MEANS OF INSERTION-DELETION SYSTEMS ⋮ On the computing powers of \(\mathcal{L}\)-reductions of insertion languages ⋮ Homomorphic characterizations of recursively enumerable languages with very small language classes
Cites Work
- Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
- Left universal context-free grammars and homomorphic characterizations of languages
- A universal context-free grammar
- A Purely Homomorphic Characterization of Recursively Enumerable Sets
- One-way stack automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A homomorphic characterization of recursively enumerable languages
