Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Finkel, Olivier
and
Lecomte, Dominique
2007.
Computer Science Logic.
Vol. 4646,
Issue. ,
p.
115.
Carton, Olivier
Finkel, Olivier
and
Simonnet, Pierre
2008.
On the continuity set of an Omega rational function.
RAIRO - Theoretical Informatics and Applications,
Vol. 42,
Issue. 1,
p.
183.
Selivanov, Victor L.
2008.
Fine hierarchies and m-reducibilities in theoretical computer science.
Theoretical Computer Science,
Vol. 405,
Issue. 1-2,
p.
116.
Duparc, Jacques
Facchini, Alessandro
and
Murlak, Filip
2009.
Computer Science Logic.
Vol. 5771,
Issue. ,
p.
225.
Finkel, Olivier
2009.
The Complexity of Infinite Computations In Models of Set Theory.
Logical Methods in Computer Science,
Vol. Volume 5, Issue 4,
Issue. ,
Finkel, Olivier
and
Lecomte, Dominique
2009.
Classical and effective descriptive complexities of ω-powers.
Annals of Pure and Applied Logic,
Vol. 160,
Issue. 2,
p.
163.
Finkel, Olivier
2009.
Highly Undecidable Problems For Infinite Computations.
RAIRO - Theoretical Informatics and Applications,
Vol. 43,
Issue. 2,
p.
339.
FINKEL, OLIVIER
2012.
THREE APPLICATIONS TO RATIONAL RELATIONS OF THE HIGH UNDECIDABILITY OF THE INFINITE POST CORRESPONDENCE PROBLEM IN A REGULAR ω-LANGUAGE.
International Journal of Foundations of Computer Science,
Vol. 23,
Issue. 07,
p.
1481.
Cabessa, Jérémie
and
Villa, Alessandro E.P.
2012.
The expressive power of analog recurrent neural networks on infinite input streams.
Theoretical Computer Science,
Vol. 436,
Issue. ,
p.
23.
Finkel, Olivier
2013.
The Determinacy of Context-Free Games.
The Journal of Symbolic Logic,
Vol. 78,
Issue. 4,
p.
1115.
Duparc, Jacques
Finkel, Olivier
and
Ressayre, Jean-Pierre
2013.
Logical Foundations of Computer Science.
Vol. 7734,
Issue. ,
p.
179.
Finkel, Olivier
and
Skrzypczak, Michał
2014.
On the topological complexity of ω-languages of non-deterministic Petri nets.
Information Processing Letters,
Vol. 114,
Issue. 5,
p.
229.
Finkel, Olivier
2014.
Language, Culture, Computation. Computing - Theory and Technology.
Vol. 8001,
Issue. ,
p.
50.
Finkel, Olivier
2015.
Automata, Languages, and Programming.
Vol. 9135,
Issue. ,
p.
222.
Finkel, Olivier
2016.
Locally finite ω‐languages and effective analytic sets have the same topological complexity.
Mathematical Logic Quarterly,
Vol. 62,
Issue. 4-5,
p.
303.
Finkel, Olivier
2016.
Infinite games specified by 2-tape automata.
Annals of Pure and Applied Logic,
Vol. 167,
Issue. 12,
p.
1184.
Li, Wenjuan
and
Tanaka, Kazuyuki
2017.
The determinacy strength of pushdownω-languages.
RAIRO - Theoretical Informatics and Applications,
Vol. 51,
Issue. 1,
p.
29.
Skrzypczak, Michał
2018.
Reachability Problems.
Vol. 11123,
Issue. ,
p.
133.
Selivanov, Victor
2020.
Descriptional Complexity of Formal Systems.
Vol. 12442,
Issue. ,
p.
193.
Finkel, Olivier
2020.
Application and Theory of Petri Nets and Concurrency.
Vol. 12152,
Issue. ,
p.
69.