Stretchings. - Olivier Finkel; Jean-Pierre Ressayre (J. Symb. Log., 1996)

An Effective Extension of the Wagner Hierarchy to Blind Counter Automata. - Olivier Finkel (CSL, 2001)

Computer science and the fine structure of Borel sets. - Jacques Duparc; Olivier Finkel; Jean-Pierre Ressayre (Theor. Comput. Sci., 2001)

Locally finite languages. - Olivier Finkel (Theor. Comput. Sci., 2001)

Topological properties of omega context-free languages. - Olivier Finkel (Theor. Comput. Sci., 2001)

Wadge hierarchy of omega context-free languages. - Olivier Finkel (Theor. Comput. Sci., 2001)

On Infinitary Rational Relations and Borel Sets. - Olivier Finkel (DMTCS, 2003)

On the Topological Complexity of Infinitary Rational Relations. - Olivier Finkel (RAIRO Theor. Informatics Appl., 2003)

Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations. - Olivier Finkel (RAIRO Theor. Informatics Appl., 2003)

Borel hierarchy and omega context free languages. - Olivier Finkel (Theor. Comput. Sci., 2003)

Ambiguity in omega context free languages. - Olivier Finkel (Theor. Comput. Sci., 2003)

On omega context free languages which are Borel sets of infinite rank. - Olivier Finkel (Theor. Comput. Sci., 2003)

An omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank. - Olivier Finkel (Fundam. Informaticae, 2004)

On Recognizable Languages Of Infinite Pictures. - Olivier Finkel (Int. J. Found. Comput. Sci., 2004)

Closure properties of locally finite omega-languages. - Olivier Finkel (Theor. Comput. Sci., 2004)

On Decision Problems for Timed Automata. - Olivier Finkel (Bull. EATCS, 2005)

On Winning Conditions of High Borel Complexity in Pushdown Games. - Olivier Finkel (Fundam. Informaticae, 2005)

On the Length of the Wadge Hierarchy of ω-Context Free Languages. - Olivier Finkel (J. Autom. Lang. Comb., 2005)

Undecidable Problems About Timed Automata. - Olivier Finkel (FORMATS, 2006)

On the Accepting Power of 2-Tape Büchi Automata. - Olivier Finkel (STACS, 2006)

On the Shuffle of Regular Timed Languages. - Olivier Finkel (Bull. EATCS, 2006)

Borel ranks and Wadge degrees of context free omega-languages. - Olivier Finkel (Math. Struct. Comput. Sci., 2006)

On decidability properties of local sentences. - Olivier Finkel (Theor. Comput. Sci., 2006)

There Exist Some omega -Powers of Any Borel Rank. - Olivier Finkel; Dominique Lecomte (CSL, 2007)

There Exist some Omega-Powers of Any Borel Rank - Dominique Lecomte; Olivier Finkel (CoRR, 2007)

An Example of Pi^0_3-complete Infinitary Rational Relation - Olivier Finkel (CoRR, 2007)

An Example of ∏03-complete Infinitary Rational Relation. - Olivier Finkel (Comput. Sci. J. Moldova, 2007)

Local sentences and Mahlo cardinals. - Olivier Finkel; Stevo Todorcevic (Math. Log. Q., 2007)

Topological Complexity of omega-Powers: Extended Abstract. - Olivier Finkel; Dominique Lecomte (Topological and Game-Theoretic Aspects of Infinite Computations, 2008)

Topological complexity of locally finite omega -languages. - Olivier Finkel (Arch. Math. Log., 2008)

Topology and Ambiguity in Omega Context Free Languages - Olivier Finkel; Pierre Simonnet (CoRR, 2008)

On the Length of the Wadge Hierarchy of Omega Context Free Languages - Olivier Finkel (CoRR, 2008)

On Infinite Real Trace Rational Languages of Maximum Topological Complexity - Olivier Finkel; Jean-Pierre Ressayre; Pierre Simonnet (CoRR, 2008)

An omega-power of a context-free language which is Borel above Delta^0_omega - Jacques Duparc; Olivier Finkel (CoRR, 2008)

Topological Complexity of Context-Free omega-Languages: A Survey - Olivier Finkel (CoRR, 2008)

On the continuity set of an Omega rational function. - Olivier Carton; Olivier Finkel; Pierre Simonnet (RAIRO Theor. Informatics Appl., 2008)

Wadge Degrees of Infinitary Rational Relations. - Olivier Finkel (Math. Comput. Sci., 2008)

Classical and effective descriptive complexities of omega-powers. - Olivier Finkel; Dominique Lecomte (Ann. Pure Appl. Log., 2009)

The Complexity of Infinite Computations In Models of Set Theory - Olivier Finkel (Log. Methods Comput. Sci., 2009)

On Some Sets of Dictionaries Whose omega-Powers Have a Given Complexity - Olivier Finkel (CoRR, 2009)

Highly Undecidable Problems about Recognizability by Tiling Systems. - Olivier Finkel (Fundam. Informaticae, 2009)

On Recognizable Tree Languages Beyond the Borel Hierarchy. - Olivier Finkel; Pierre Simonnet (Fundam. Informaticae, 2009)

Decision problems for Turing machines. - Olivier Finkel; Dominique Lecomte (Inf. Process. Lett., 2009)

Highly Undecidable Problems For Infinite Computations. - Olivier Finkel (RAIRO Theor. Informatics Appl., 2009)

The Isomorphism Relation Between Tree-Automatic Structures - Olivier Finkel; Stevo Todorcevic (CoRR, 2010)

On some sets of dictionaries whose omega -powers have a given. - Olivier Finkel (Math. Log. Q., 2010)

Three Applications to Rational Relations of the High Undecidability of the Infinite Post Correspondence Problem in a Regular omega-Language. - Olivier Finkel (CoRR, 2011)

Decision Problems for Recognizable Languages of Infinite Pictures - Olivier Finkel (CoRR, 2011)

Some problems in automata theory which depend on the models of set theory. - Olivier Finkel (RAIRO Theor. Informatics Appl., 2011)

On Decidability Properties of One-Dimensional Cellular Automata. - Olivier Finkel (J. Cell. Autom., 2011)

Three Applications to Rational Relations of the High Undecidability of the Infinite Post Correspondence Problem in a Regular ω-Language. - Olivier Finkel (Int. J. Found. Comput. Sci., 2012)

A hierarchy of tree-automatic structures. - Olivier Finkel; Stevo Todorcevic (J. Symb. Log., 2012)

The Wadge Hierarchy of Petri Nets ω-Languages. - Jacques Duparc; Olivier Finkel; Jean-Pierre Ressayre (LFCS, 2013)

Automatic Ordinals. - Olivier Finkel; Stevo Todorcevic (Int. J. Unconv. Comput., 2013)

The determinacy of context-free games. - Olivier Finkel (J. Symb. Log., 2013)

The wadge hierarchy of Petri Nets ω-languages. - Jacques Duparc; Olivier Finkel; Jean-Pierre Ressayre (Logic, Computation, Hierarchies, 2014)

Topological Complexity of Context-Free ω-Languages: A Survey. - Olivier Finkel (Language, Culture, Computation (1), 2014)

On the Topological Complexity of omega-Languages of Non-Deterministic Petri Nets. - Olivier Finkel; Michal Skrzypczak (CoRR, 2014)

Ambiguity of omega-Languages of Turing Machines - Olivier Finkel (Log. Methods Comput. Sci., 2014)

On the topological complexity of ω-languages of non-deterministic Petri nets. - Olivier Finkel; Michal Skrzypczak (Inf. Process. Lett., 2014)

Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words. - Olivier Finkel (ICALP (2), 2015)

The exact complexity of the infinite Post Correspondence Problem. - Olivier Finkel (Inf. Process. Lett., 2015)

An upper bound on the complexity of recognizable tree languages. - Olivier Finkel; Dominique Lecomte; Pierre Simonnet (RAIRO Theor. Informatics Appl., 2015)

Infinite games specified by 2-tape automata. - Olivier Finkel (Ann. Pure Appl. Log., 2016)

Locally finite ω-languages and effective analytic sets have the same topological complexity. - Olivier Finkel (Math. Log. Q., 2016)

Polishness of Some Topologies Related to Automata. - Olivier Carton; Olivier Finkel; Dominique Lecomte (CSL, 2017)

Expressive Power of Evolving Neural Networks Working on Infinite Input Streams. - Jérémie Cabessa; Olivier Finkel (FCT, 2017)

Polishness of some topologies related to automata (Extended version). - Olivier Finkel; Olivier Carton; Dominique Lecomte (CoRR, 2017)

Wadge Degrees of ω-Languages of Petri Nets. - Olivier Finkel (CoRR, 2017)

An Effective Property of ω-Rational Functions. - Olivier Finkel (CoRR, 2018)

Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words. - Olivier Finkel (Int. J. Found. Comput. Sci., 2019)

Computational capabilities of analog and evolving neural networks over infinite input streams. - Jérémie Cabessa; Olivier Finkel (J. Comput. Syst. Sci., 2019)

Polishness of some topologies related to word or tree automata. - Olivier Finkel; Olivier Carton; Dominique Lecomte (Log. Methods Comput. Sci., 2019)

On the High Complexity of Petri Nets ømega-Languages. - Olivier Finkel (Petri Nets, 2020)

The Automatic Baire Property and an Effective Property of ømega-Rational Functions. - Olivier Finkel (LATA, 2020)

Some complete ω-powers of a one-counter language, for any Borel class of finite rank. - Olivier Finkel; Dominique Lecomte (CoRR, 2020)

Descriptive Set Theory and ω-Powers of Finitary Languages. - Olivier Finkel; Dominique Lecomte (CoRR, 2020)

Some complete ømega-powers of a one-counter language, for any Borel class of finite rank. - Olivier Finkel; Dominique Lecomte (Arch. Math. Log., 2021)

On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words. - Olivier Finkel; Michal Skrzypczak (Fundam. Informaticae, 2021)

Two Effective Properties of ω-Rational Functions. - Olivier Finkel (Int. J. Found. Comput. Sci., 2021)

On bi-infinite and conjugate post correspondence problems. - Olivier Finkel; Vesa Halava; Tero Harju; Esa Sahla (RAIRO Theor. Informatics Appl., 2023)

Wadge degrees of Δ02 omega-powers. - Olivier Finkel; Dominique Lecomte (CoRR, 2024)