Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations

DOI10.1051/ITA:2003013zbMath1112.03312OpenAlexW2035905643MaRDI QIDQ4825476

Olivier Finkel

Publication date: 28 October 2004

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

Full work available at URL: http://www.numdam.org/item?id=ITA_2003__37_2_115_0

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 (7)

On the continuity set of an Omega rational function ⋮ Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words ⋮ Incompleteness Theorems, Large Cardinals, and Automata over Finite Words ⋮ ON RECOGNIZABLE LANGUAGES OF INFINITE PICTURES ⋮ Automata, Borel functions and real numbers in Pisot base ⋮ Highly Undecidable Problems For Infinite Computations ⋮ The exact complexity of the infinite Post Correspondence Problem

Cites Work

• Synchronized rational relations of finite and infinite words
• Relations rationnelles infinitaires
• Descriptive set theory
• Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
• How to decide continuity of rational functions on infinite words
• Logic, semigroups and automata on words
• On the Topological Complexity of Infinitary Rational Relations
• Decision problems forω-automata
• 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: Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations