A Morphic Representation of Complements of Recursively Enumerable Sets

DOI10.1145/322276.322282MaRDI QIDQ3953201zbMATH OpenOpenAlexFDO

Authors Andrzej Ehrenfeucht, Keijo Ruohonen, Grzegorz Rozenberg

Publication date 1981

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/322276.322282

zbMATH Keywords

recursively enumerable languageequality setsword morphismmorphism representation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Recursively (computably) enumerable sets and degrees (03D25) Turing machines and related notions (03D10)

Cited in

(4)

• A morphic representation of EOL languages and other ETOL languages
• On morphically generated formal power series
• Representations of language families by homomorphic equality operations and generalized equality sets
• On generalized DT0L systems and their fixed points

This page was built for publication: A Morphic Representation of Complements of Recursively Enumerable Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3953201)