Homomorphic characterizations of recursively enumerable languages with very small language classes

DOI10.1016/S0304-3975(99)00110-3MaRDI QIDQ1589418zbMATH OpenWikidataFDO

Authors Satoshi Okawa, S. Hirose

Publication date 12 December 2000

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

Full work available at URL https://doi.org/10.1016/S0304-3975(99)00110-3

zbMATH Keywords

formal language theoryhomomorphic characterization

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• A homomorphic characterization of recursively enumerable languages
• On characterizations of recursively enumerable languages
• scientific article; zbMATH DE number 1008508
• scientific article; zbMATH DE number 58294
• scientific article; zbMATH DE number 3878379

Cites work

• scientific article; zbMATH DE number 3767067 (Why is no real title available?)
• A homomorphic characterization of recursively enumerable languages
• Generalizations of regular events
• 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

(6)

• scientific article; zbMATH DE number 1774219 (Why is no real title available?)
• A representation of recursively enumerable languages by two homomorphisms and a quotient
• scientific article; zbMATH DE number 58294 (Why is no real title available?)
• scientific article; zbMATH DE number 58295 (Why is no real title available?)
• Separating the classes of recursively enumerable languages based on machine size
• A homomorphic characterization of recursively enumerable languages

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)