Olivier Finkel

118 papers A 2B 5C 4Misc 1Journal 100Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
Some regular ω-powers in the Hausdorff-Kuratowski hierarchy.
Theor. Comput. Sci.
Olivier Finkel, Johan Girardot, Dominiquelecomte
2026 J jnl
Toward higher-order infinite time Turing machines: simulational Γ-machines.
Ann. Pure Appl. Log.
Olivier Bournez, Olivier Finkel, Johan Girardot
2024 J jnl
Wadge degrees of Δ
CoRR
Olivier Finkel, Dominique Lecomte
2023 J jnl
On bi-infinite and conjugate post correspondence problems.
RAIRO Theor. Informatics Appl.
Olivier Finkel, Vesa Halava, Tero Harju, Esa Sahla
2021 J jnl
On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words.
Fundam. Informaticae
Olivier Finkel, Michal Skrzypczak
2021 J jnl
On the expressive power of non-deterministic and unambiguous Petri nets over infinite words.
CoRR
Olivier Finkel, Michal Skrzypczak
2021 J jnl
Some complete ømega-powers of a one-counter language, for any Borel class of finite rank.
Arch. Math. Log.
Olivier Finkel, Dominique Lecomte
2021 J jnl
Two Effective Properties of ω-Rational Functions.
Int. J. Found. Comput. Sci.
Olivier Finkel
2020 J jnl
Descriptive Set Theory and ω-Powers of Finitary Languages.
CoRR
Olivier Finkel, Dominique Lecomte
2020 B conf
On the High Complexity of Petri Nets ømega-Languages.
Petri Nets
Olivier Finkel
2020 J jnl
Some complete ω-powers of a one-counter language, for any Borel class of finite rank.
CoRR
Olivier Finkel, Dominique Lecomte
2020 C conf
The Automatic Baire Property and an Effective Property of ømega-Rational Functions.
LATA
Olivier Finkel
2019 J jnl
Computational capabilities of analog and evolving neural networks over infinite input streams.
J. Comput. Syst. Sci.
Jérémie Cabessa, Olivier Finkel
2019 J jnl
Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words.
Int. J. Found. Comput. Sci.
Olivier Finkel
2019 J jnl
Polishness of some topologies related to word or tree automata.
Log. Methods Comput. Sci.
Olivier Finkel, Olivier Carton, Dominique Lecomte
2018 J jnl
An Effective Property of ω-Rational Functions.
CoRR
Olivier Finkel
2017 B conf
Expressive Power of Evolving Neural Networks Working on Infinite Input Streams.
FCT
Jérémie Cabessa, Olivier Finkel
2017 C conf
Incompleteness Theorems, Large Cardinals, and Automata over Finite Words.
TAMC
Olivier Finkel
2017 B conf
Polishness of Some Topologies Related to Automata.
CSL
Olivier Carton, Olivier Finkel, Dominique Lecomte
2017 J jnl
Polishness of some topologies related to automata (Extended version).
CoRR
Olivier Finkel, Olivier Carton, Dominique Lecomte
2017 J jnl
Wadge Degrees of ω-Languages of Petri Nets.
CoRR
Olivier Finkel
2016 J jnl
Infinite games specified by 2-tape automata.
Ann. Pure Appl. Log.
Olivier Finkel
2016 J jnl
Locally finite ω-languages and effective analytic sets have the same topological complexity.
Math. Log. Q.
Olivier Finkel
2015 J jnl
An Upper Bound on the Complexity of Recognizable Tree Languages.
CoRR
Olivier Finkel, Dominique Lecomte, Pierre Simonnet
2015 J jnl
An upper bound on the complexity of recognizable tree languages.
RAIRO Theor. Informatics Appl.
Olivier Finkel, Dominique Lecomte, Pierre Simonnet
2015 — conf
Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words.
ICALP (2)
Olivier Finkel
2015 J jnl
The exact complexity of the infinite Post Correspondence Problem.
Inf. Process. Lett.
Olivier Finkel
2014 J jnl
Ambiguity of omega-Languages of Turing Machines
Log. Methods Comput. Sci.
Olivier Finkel
2014 J jnl
On the Topological Complexity of omega-Languages of Non-Deterministic Petri Nets.
CoRR
Olivier Finkel, Michal Skrzypczak
2014 J jnl
On the topological complexity of ω-languages of non-deterministic Petri nets.
Inf. Process. Lett.
Olivier Finkel, Michal Skrzypczak
2014 — ch.
The wadge hierarchy of Petri Nets ω-languages.
Logic, Computation, Hierarchies
Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre
2014 — conf
Topological Complexity of Context-Free ω-Languages: A Survey.
Language, Culture, Computation (1)
Olivier Finkel
2013 J jnl
Automatic Ordinals.
Int. J. Unconv. Comput.
Olivier Finkel, Stevo Todorcevic
2013 J jnl
Infinite Games Specified by 2-Tape Automata.
CoRR
Olivier Finkel
2013 J jnl
The Determinacy of Context-Free Games.
CoRR
Olivier Finkel
2013 Misc conf
The Wadge Hierarchy of Petri Nets
LFCS
Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre
2013 J jnl
The determinacy of context-free games.
J. Symb. Log.
Olivier Finkel
2012 J jnl
A hierarchy of tree-automatic structures.
J. Symb. Log.
Olivier Finkel, Stevo Todorcevic
2012 J jnl
Automatic Ordinals
CoRR
Olivier Finkel, Stevo Todorcevic
2012 A conf
The Determinacy of Context-Free Games.
STACS
Olivier Finkel
2012 J jnl
Three Applications to Rational Relations of the High Undecidability of the Infinite Post Correspondence Problem in a Regular ω-Language.
Int. J. Found. Comput. Sci.
Olivier Finkel
2011 J jnl
A Hierarchy of Tree-Automatic Structures
CoRR
Olivier Finkel, Stevo Todorcevic
2011 J jnl
Borel Hierarchy and Omega Context Free Languages
CoRR
Olivier Finkel
2011 J jnl
Decision Problems for Recognizable Languages of Infinite Pictures
CoRR
Olivier Finkel
2011 J jnl
On Decidability Properties of One-Dimensional Cellular Automata.
J. Cell. Autom.
Olivier Finkel
2011 J jnl
Some Problems in Automata Theory Which Depend on the Models of Set Theory
CoRR
Olivier Finkel
2011 J jnl
Some problems in automata theory which depend on the models of set theory.
RAIRO Theor. Informatics Appl.
Olivier Finkel
2011 J jnl
The Determinacy of Context-Free Games
CoRR
Olivier Finkel
2011 J jnl
Three Applications to Rational Relations of the High Undecidability of the Infinite Post Correspondence Problem in a Regular omega-Language.
CoRR
Olivier Finkel
2010 J jnl
An Effective Extension of the Wagner Hierarchy to Blind Counter Automata
CoRR
Olivier Finkel
2010 J jnl
On Infinitary Rational Relations and Borel Sets
CoRR
Olivier Finkel
2010 J jnl
On Omega Context Free Languages which are Borel Sets of Infinite Rank
CoRR
Olivier Finkel
2010 J jnl
On some sets of dictionaries whose
Math. Log. Q.
Olivier Finkel
2010 J jnl
The Isomorphism Relation Between Tree-Automatic Structures
CoRR
Olivier Finkel, Stevo Todorcevic
2009 J jnl
Classical and effective descriptive complexities of omega-powers.
Ann. Pure Appl. Log.
Olivier Finkel, Dominique Lecomte
2009 J jnl
Decision Problems For Turing Machines
CoRR
Olivier Finkel, Dominique Lecomte
2009 J jnl
Decision problems for Turing machines.
Inf. Process. Lett.
Olivier Finkel, Dominique Lecomte
2009 J jnl
Highly Undecidable Problems For Infinite Computations
CoRR
Olivier Finkel
2009 J jnl
Highly Undecidable Problems For Infinite Computations.
RAIRO Theor. Informatics Appl.
Olivier Finkel
2009 J jnl
Highly Undecidable Problems about Recognizability by Tiling Systems.
Fundam. Informaticae
Olivier Finkel
2009 J jnl
On Decidability Properties of One-Dimensional Cellular Automata
CoRR
Olivier Finkel
2009 J jnl
On Recognizable Languages of Infinite Pictures
CoRR
Olivier Finkel
2009 J jnl
On Recognizable Tree Languages Beyond the Borel Hierarchy
CoRR
Olivier Finkel, Pierre Simonnet
2009 J jnl
On Recognizable Tree Languages Beyond the Borel Hierarchy.
Fundam. Informaticae
Olivier Finkel, Pierre Simonnet
2009 J jnl
On Some Sets of Dictionaries Whose omega-Powers Have a Given Complexity
CoRR
Olivier Finkel
2009 J jnl
The Complexity of Infinite Computations In Models of Set Theory
Log. Methods Comput. Sci.
Olivier Finkel
2008 J jnl
An omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank
CoRR
Olivier Finkel
2008 J jnl
An omega-power of a context-free language which is Borel above Delta^0_omega
CoRR
Jacques Duparc, Olivier Finkel
2008 J jnl
Closure Properties of Locally Finite Omega Languages
CoRR
Olivier Finkel
2008 J jnl
Highly Undecidable Problems about Recognizability by Tiling Systems
CoRR
Olivier Finkel
2008 J jnl
On Infinite Real Trace Rational Languages of Maximum Topological Complexity
CoRR
Olivier Finkel, Jean-Pierre Ressayre, Pierre Simonnet
2008 J jnl
On Winning Conditions of High Borel Complexity in Pushdown Games
CoRR
Olivier Finkel
2008 J jnl
On the Continuity Set of an omega Rational Function
CoRR
Olivier Carton, Olivier Finkel, Pierre Simonnet
2008 J jnl
On the Length of the Wadge Hierarchy of Omega Context Free Languages
CoRR
Olivier Finkel
2008 J jnl
On the Topological Complexity of Infinitary Rational Relations
CoRR
Olivier Finkel
2008 J jnl
On the continuity set of an Omega rational function.
RAIRO Theor. Informatics Appl.
Olivier Carton, Olivier Finkel, Pierre Simonnet
2008 J jnl
Topological Complexity of Context-Free omega-Languages: A Survey
CoRR
Olivier Finkel
2008 J jnl
Topological Complexity of omega-Powers : Extended Abstract
CoRR
Olivier Finkel, Dominique Lecomte
2008 — conf
Topological Complexity of omega-Powers: Extended Abstract.
Topological and Game-Theoretic Aspects of Infinite Computations
Olivier Finkel, Dominique Lecomte
2008 J jnl
Topological complexity of locally finite
Arch. Math. Log.
Olivier Finkel
2008 J jnl
Topology and Ambiguity in Omega Context Free Languages
CoRR
Olivier Finkel, Pierre Simonnet
2008 J jnl
Wadge Degrees of Infinitary Rational Relations
CoRR
Olivier Finkel
2008 J jnl
Wadge Degrees of Infinitary Rational Relations.
Math. Comput. Sci.
Olivier Finkel
2007 J jnl
An Example of Pi^0_3-complete Infinitary Rational Relation
CoRR
Olivier Finkel
2007 J jnl
An Example of ∏
Comput. Sci. J. Moldova
Olivier Finkel
2007 J jnl
Borel Ranks and Wadge Degrees of Context Free Omega Languages
CoRR
Olivier Finkel
2007 J jnl
Classical and Effective Descriptive Complexities of omega-Powers
CoRR
Olivier Finkel, Dominique Lecomte
2007 J jnl
Local sentences and Mahlo cardinals.
Math. Log. Q.
Olivier Finkel, Stevo Todorcevic
2007 J jnl
On Decidability Properties of Local Sentences
CoRR
Olivier Finkel
2007 J jnl
On the Accepting Power of 2-Tape Büchi Automata
CoRR
Olivier Finkel
2007 B conf
There Exist Some
CSL
Olivier Finkel, Dominique Lecomte
2007 J jnl
There Exist some Omega-Powers of Any Borel Rank
CoRR
Dominique Lecomte, Olivier Finkel
2007 J jnl
Undecidable Problems About Timed Automata
CoRR
Olivier Finkel
2006 J jnl
Borel ranks and Wadge degrees of context free omega-languages.
Math. Struct. Comput. Sci.
Olivier Finkel
2006 J jnl
On decidability properties of local sentences.
Theor. Comput. Sci.
Olivier Finkel
2006 A conf
On the Accepting Power of 2-Tape Büchi Automata.
STACS
Olivier Finkel
2006 J jnl
On the Shuffle of Regular Timed Languages.
Bull. EATCS
Olivier Finkel
2006 — conf
Undecidable Problems About Timed Automata.
FORMATS
Olivier Finkel
2005 C conf
Borel Ranks and Wadge Degrees of Context Free omega-Languages.
CiE
Olivier Finkel
2005 J jnl
On Decision Problems for Timed Automata.
Bull. EATCS
Olivier Finkel
2005 J jnl
On Winning Conditions of High Borel Complexity in Pushdown Games.
Fundam. Informaticae
Olivier Finkel
2005 J jnl
On the Length of the Wadge Hierarchy of ω-Context Free Languages.
J. Autom. Lang. Comb.
Olivier Finkel
2004 J jnl
An omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank.
Fundam. Informaticae
Olivier Finkel
2004 J jnl
Closure properties of locally finite omega-languages.
Theor. Comput. Sci.
Olivier Finkel
2004 C conf
On Decidability Properties of Local Sentences.
WoLLIC
Olivier Finkel
2004 J jnl
On Recognizable Languages Of Infinite Pictures.
Int. J. Found. Comput. Sci.
Olivier Finkel
2003 J jnl
Ambiguity in omega context free languages.
Theor. Comput. Sci.
Olivier Finkel
2003 J jnl
Borel hierarchy and omega context free languages.
Theor. Comput. Sci.
Olivier Finkel
2003 — conf
On Infinitary Rational Relations and Borel Sets.
DMTCS
Olivier Finkel
2003 J jnl
On omega context free languages which are Borel sets of infinite rank.
Theor. Comput. Sci.
Olivier Finkel
2003 J jnl
On the Topological Complexity of Infinitary Rational Relations.
RAIRO Theor. Informatics Appl.
Olivier Finkel
2003 J jnl
Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations.
RAIRO Theor. Informatics Appl.
Olivier Finkel
2001 B conf
An Effective Extension of the Wagner Hierarchy to Blind Counter Automata.
CSL
Olivier Finkel
2001 J jnl
Computer science and the fine structure of Borel sets.
Theor. Comput. Sci.
Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre
2001 J jnl
Locally finite languages.
Theor. Comput. Sci.
Olivier Finkel
2001 J jnl
Topological properties of omega context-free languages.
Theor. Comput. Sci.
Olivier Finkel
2001 J jnl
Wadge hierarchy of omega context-free languages.
Theor. Comput. Sci.
Olivier Finkel
1996 J jnl
Stretchings.
J. Symb. Log.
Olivier Finkel, Jean-Pierre Ressayre