Highly Undecidable Problems For Infinite Computations
RAIRO-Theor. Inf. Appl., 43 2 (2009) 339-364
Published online: 2009-02-14
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):
14740 237 (2024)
https://doi.org/10.1007/978-3-031-63501-4_13
Two Effective Properties of ω-Rational Functions
Olivier FinkelInternational Journal of Foundations of Computer Science 32 (07) 901 (2021)
https://doi.org/10.1142/S0129054121500283
12038 303 (2020)
https://doi.org/10.1007/978-3-030-40608-0_21
Application and Theory of Petri Nets and Concurrency
Olivier FinkelLecture Notes in Computer Science, Application and Theory of Petri Nets and Concurrency 12152 69 (2020)
https://doi.org/10.1007/978-3-030-51831-8_4
Infinite games specified by 2-tape automata
Olivier FinkelAnnals of Pure and Applied Logic 167 (12) 1184 (2016)
https://doi.org/10.1016/j.apal.2016.05.005
Locally finite ω‐languages and effective analytic sets have the same topological complexity
Olivier FinkelMathematical Logic Quarterly 62 (4-5) 303 (2016)
https://doi.org/10.1002/malq.201400113
Logical Foundations of Computer Science
Jacques Duparc, Olivier Finkel and Jean-Pierre RessayreLecture Notes in Computer Science, Logical Foundations of Computer Science 7734 179 (2013)
https://doi.org/10.1007/978-3-642-35722-0_13
The Determinacy of Context-Free Games
Olivier FinkelThe Journal of Symbolic Logic 78 (04) 1115 (2013)
https://doi.org/10.2178/jsl/1058448446
The isomorphism problem for ω-automatic trees
Dietrich Kuske, Jiamou Liu and Markus LohreyAnnals of Pure and Applied Logic 164 (1) 30 (2013)
https://doi.org/10.1016/j.apal.2012.09.001
The Determinacy of Context-Free Games
Olivier FinkelThe Journal of Symbolic Logic 78 (4) 1115 (2013)
https://doi.org/10.2178/jsl.7804050
THREE APPLICATIONS TO RATIONAL RELATIONS OF THE HIGH UNDECIDABILITY OF THE INFINITE POST CORRESPONDENCE PROBLEM IN A REGULAR ω-LANGUAGE
OLIVIER FINKELInternational Journal of Foundations of Computer Science 23 (07) 1481 (2012)
https://doi.org/10.1142/S0129054112400606
Some problems in automata theory which depend on the models of set theory
Olivier FinkelRAIRO - Theoretical Informatics and Applications 45 (4) 383 (2011)
https://doi.org/10.1051/ita/2011113
The Complexity of Infinite Computations In Models of Set Theory
Olivier FinkelLogical Methods in Computer Science Volume 5, Issue 4 (2009)
https://doi.org/10.2168/LMCS-5(4:4)2009