On the Topological Complexity of Infinitary Rational Relations

DOI10.1051/ita:2003016zbMath1112.03313arXiv0803.1841OpenAlexW1574255085MaRDI QIDQ4825475

Olivier Finkel

Publication date: 28 October 2004

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0803.1841

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Descriptive set theory (03E15) Automata and formal grammars in connection with logical questions (03D05) Hierarchies of computability and definability (03D55)

Related Items (5)

Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations ⋮ On the continuity set of an Omega rational function ⋮ ON RECOGNIZABLE LANGUAGES OF INFINITE PICTURES ⋮ Automata, Borel functions and real numbers in Pisot base ⋮ Highly Undecidable Problems For Infinite Computations

Cites Work

• Relations rationnelles infinitaires
• Descriptive set theory
• \(X\)-automata on \(\omega\)-words
• Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
• Logic, semigroups and automata on words
• Decision problems forω-automata
• Computer science and the fine structure of Borel sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Topological Complexity of Infinitary Rational Relations