Homomorphic characterizations of recursively enumerable languages with very small language classes
From MaRDI portal
Recommendations
Cites work
- A homomorphic characterization of recursively enumerable languages
- Generalizations of regular events
- scientific article; zbMATH DE number 3767067 (Why is no real title available?)
- On a family of linear grammars
- One-way stack automata
- Reversal-bounded multipushdown machines
- The decidability of equivalence for a family of linear grammars
Cited in
(9)- A homomorphic characterization of recursively enumerable languages
- A representation of recursively enumerable languages by two homomorphisms and a quotient
- Separating the classes of recursively enumerable languages based on machine size
- scientific article; zbMATH DE number 58294 (Why is no real title available?)
- scientific article; zbMATH DE number 58295 (Why is no real title available?)
- scientific article; zbMATH DE number 1346364 (Why is no real title available?)
- scientific article; zbMATH DE number 1008508 (Why is no real title available?)
- scientific article; zbMATH DE number 1057351 (Why is no real title available?)
- scientific article; zbMATH DE number 1774219 (Why is no real title available?)
This page was built for publication: Homomorphic characterizations of recursively enumerable languages with very small language classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1589418)