A representation of recursively enumerable languages by two homomorphisms and a quotient

DOI10.1016/0304-3975(88)90068-0zbMath0664.68075OpenAlexW1986713860MaRDI QIDQ1115633

Viliam Geffert

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90068-0

zbMATH Keywords

representationhomomorphismsrecursively enumerable setquotient

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Normal forms for phrase-structure grammars ⋮ On the power of cooperation: A regular representation of recursively enumerable languages ⋮ On characterizations of recursively enumerable languages ⋮ Finite transducers and rational transductions

Cites Work

• A homomorphic characterization of time and space complexity classes of languages†
• Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
• A Purely Homomorphic Characterization of Recursively Enumerable Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item