Čulik, Karel II A purely homomorphic characterization of recursively enumerable sets. (English) Zbl 0395.68076 J. Assoc. Comput. Mach. 26, 345-350 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 ReviewsCited in 32 Documents MSC: 68Q45 Formal languages and automata 03D25 Recursively (computably) enumerable sets and degrees Keywords:Post Correspondence Problem; Recursively Enumerable Sets; Regular Sets; Homomorphic Characterization; Minimal Sets; Languages; Equality; Complexity; Automata PDFBibTeX XMLCite \textit{K. Čulik II}, J. Assoc. Comput. Mach. 26, 345--350 (1979; Zbl 0395.68076) Full Text: DOI