Some Characterization of Recursively Enumerable Sets

DOI10.1080/00207160211924MaRDI QIDQ4780528zbMATH OpenOpenAlexFDO

Authors Wit Foryś

Publication date 2002

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160211924

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Recursively (computably) enumerable sets and degrees (03D25)

Recommendations

• A class of recursively enumerable sets
• On a Class of Recursively Enumerable Sets
• Some Theorems on Classes of Recursively Enumerable Sets
• RECURSIVELY ENUMERABLE SETS AND WELL-ORDERING OF THEIR ENUMERATIONS
• Completely recursively enumerable sets
• Recursively EnumerableL-Sets
• Some reducibilities and splittings of recursively enumerable sets
• scientific article; zbMATH DE number 3997771
• scientific article; zbMATH DE number 3959401
• scientific article; zbMATH DE number 3857079

Cites work

• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• Bifaithful starry transductions
• Fixed point languages of rational transductions
• Representations of language families by homomorphic equality operations and generalized equality sets
• Transductions des langages de Chomsky

Cited in

(4)

• On a Class of Recursively Enumerable Sets
• Some Theorems on Classes of Recursively Enumerable Sets
• RECURSIVELY ENUMERABLE SETS AND WELL-ORDERING OF THEIR ENUMERATIONS
• scientific article; zbMATH DE number 3878379 (Why is no real title available?)

This page was built for publication: Some Characterization of Recursively Enumerable Sets

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