On the Topological Complexity of Infinitary Rational Relations
RAIRO-Theor. Inf. Appl., 37 2 (2003) 105-113
Published online: 2003-11-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Highly Undecidable Problems For Infinite Computations
Olivier FinkelRAIRO - Theoretical Informatics and Applications 43 (2) 339 (2009)
https://doi.org/10.1051/ita/2009001
On the continuity set of an Omega rational function
Olivier Carton, Olivier Finkel and Pierre SimonnetRAIRO - Theoretical Informatics and Applications 42 (1) 183 (2008)
https://doi.org/10.1051/ita:2007050
Automata, Borel functions and real numbers in Pisot base
Benoit Cagnard and Pierre SimonnetRAIRO - Theoretical Informatics and Applications 41 (1) 27 (2007)
https://doi.org/10.1051/ita:2007007
STACS 2006
Olivier FinkelLecture Notes in Computer Science, STACS 2006 3884 301 (2006)
https://doi.org/10.1007/11672142_24
On infinite real trace rational languages of maximum topological complexity
O. Finkel, J.-P. Ressayre and P. SimonnetJournal of Mathematical Sciences 134 (5) 2435 (2006)
https://doi.org/10.1007/s10958-006-0120-z
ON RECOGNIZABLE LANGUAGES OF INFINITE PICTURES
OLIVIER FINKELInternational Journal of Foundations of Computer Science 15 (06) 823 (2004)
https://doi.org/10.1142/S0129054104002777
Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations
Olivier FinkelRAIRO - Theoretical Informatics and Applications 37 (2) 115 (2003)
https://doi.org/10.1051/ita:2003013