Olivier Finkel

ORCID

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 21

Top Venues

CoRR

RAIRO Theor. Informatics Appl.

Inf. Process. Lett.

Int. J. Found. Comput. Sci.

Publications

Olivier Finkel, Dominique Lecomte
omega-powers. CoRR (2024)
Olivier Finkel, Vesa Halava, Tero Harju, Esa Sahla
On bi-infinite and conjugate post correspondence problems. RAIRO Theor. Informatics Appl. 57 (2023)
Olivier Finkel, Michal Skrzypczak
On the expressive power of non-deterministic and unambiguous Petri nets over infinite words. CoRR (2021)
Olivier Finkel, Michal Skrzypczak
On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words. Fundam. Informaticae 183 (3-4) (2021)
Olivier Finkel, Dominique Lecomte
Some complete ømega-powers of a one-counter language, for any Borel class of finite rank. Arch. Math. Log. 60 (1-2) (2021)
Olivier Finkel
Two Effective Properties of ω-Rational Functions. Int. J. Found. Comput. Sci. 32 (7) (2021)
Olivier Finkel
The Automatic Baire Property and an Effective Property of ømega-Rational Functions. LATA (2020)
Olivier Finkel, Dominique Lecomte
Some complete ω-powers of a one-counter language, for any Borel class of finite rank. CoRR (2020)
Olivier Finkel, Dominique Lecomte
Descriptive Set Theory and ω-Powers of Finitary Languages. CoRR (2020)
Olivier Finkel
On the High Complexity of Petri Nets ømega-Languages. Petri Nets (2020)
Olivier Finkel
Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words. Int. J. Found. Comput. Sci. 30 (3) (2019)
Jérémie Cabessa, Olivier Finkel
Computational capabilities of analog and evolving neural networks over infinite input streams. J. Comput. Syst. Sci. 101 (2019)
Olivier Finkel, Olivier Carton, Dominique Lecomte
Polishness of some topologies related to word or tree automata. Log. Methods Comput. Sci. 15 (2) (2019)
Olivier Finkel
An Effective Property of ω-Rational Functions. CoRR (2018)
Olivier Finkel
Incompleteness Theorems, Large Cardinals, and Automata over Finite Words. TAMC (2017)
Olivier Finkel
Wadge Degrees of ω-Languages of Petri Nets. CoRR (2017)
Jérémie Cabessa, Olivier Finkel
Expressive Power of Evolving Neural Networks Working on Infinite Input Streams. FCT (2017)
Olivier Finkel, Olivier Carton, Dominique Lecomte
Polishness of some topologies related to automata (Extended version). CoRR (2017)
Olivier Carton, Olivier Finkel, Dominique Lecomte
Polishness of Some Topologies Related to Automata. CSL (2017)
Olivier Finkel
Infinite games specified by 2-tape automata. Ann. Pure Appl. Log. 167 (12) (2016)
Olivier Finkel
Locally finite ω-languages and effective analytic sets have the same topological complexity. Math. Log. Q. 62 (4-5) (2016)
Olivier Finkel, Dominique Lecomte, Pierre Simonnet
An Upper Bound on the Complexity of Recognizable Tree Languages. CoRR (2015)
Olivier Finkel
Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words. ICALP (2) (2015)
Olivier Finkel, Dominique Lecomte, Pierre Simonnet
An upper bound on the complexity of recognizable tree languages. RAIRO Theor. Informatics Appl. 49 (2) (2015)
Olivier Finkel
The exact complexity of the infinite Post Correspondence Problem. Inf. Process. Lett. 115 (6-8) (2015)
Olivier Finkel, Michal Skrzypczak
On the Topological Complexity of omega-Languages of Non-Deterministic Petri Nets. CoRR (2014)
Olivier Finkel
Topological Complexity of Context-Free ω-Languages: A Survey. Language, Culture, Computation (1) (2014)
Olivier Finkel
Ambiguity of omega-Languages of Turing Machines Log. Methods Comput. Sci. 10 (3) (2014)
Olivier Finkel, Michal Skrzypczak
On the topological complexity of ω-languages of non-deterministic Petri nets. Inf. Process. Lett. 114 (5) (2014)
Olivier Finkel
The determinacy of context-free games. J. Symb. Log. 78 (4) (2013)
Olivier Finkel, Stevo Todorcevic
Automatic Ordinals. Int. J. Unconv. Comput. 9 (1-2) (2013)
Olivier Finkel
Infinite Games Specified by 2-Tape Automata. CoRR (2013)
Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre
-Languages. LFCS (2013)
Olivier Finkel
The Determinacy of Context-Free Games. CoRR (2013)
Olivier Finkel
The Determinacy of Context-Free Games. STACS (2012)
Olivier Finkel, Stevo Todorcevic
A hierarchy of tree-automatic structures. J. Symb. Log. 77 (1) (2012)
Olivier Finkel, Stevo Todorcevic
Automatic Ordinals CoRR (2012)
Olivier Finkel
Three Applications to Rational Relations of the High Undecidability of the Infinite Post Correspondence Problem in a Regular ω-Language. Int. J. Found. Comput. Sci. 23 (7) (2012)
Olivier Finkel
Borel Hierarchy and Omega Context Free Languages CoRR (2011)
Olivier Finkel
Decision Problems for Recognizable Languages of Infinite Pictures CoRR (2011)
Olivier Finkel, Stevo Todorcevic
A Hierarchy of Tree-Automatic Structures CoRR (2011)
Olivier Finkel
The Determinacy of Context-Free Games CoRR (2011)
Olivier Finkel
On Decidability Properties of One-Dimensional Cellular Automata. J. Cell. Autom. 6 (2-3) (2011)
Olivier Finkel
Some Problems in Automata Theory Which Depend on the Models of Set Theory CoRR (2011)
Olivier Finkel
Some problems in automata theory which depend on the models of set theory. RAIRO Theor. Informatics Appl. 45 (4) (2011)
Olivier Finkel
Three Applications to Rational Relations of the High Undecidability of the Infinite Post Correspondence Problem in a Regular omega-Language. CoRR (2011)
Olivier Finkel
-powers have a given. Math. Log. Q. 56 (5) (2010)
Olivier Finkel, Stevo Todorcevic
The Isomorphism Relation Between Tree-Automatic Structures CoRR (2010)
Olivier Finkel
On Infinitary Rational Relations and Borel Sets CoRR (2010)
Olivier Finkel
On Omega Context Free Languages which are Borel Sets of Infinite Rank CoRR (2010)
Olivier Finkel
An Effective Extension of the Wagner Hierarchy to Blind Counter Automata CoRR (2010)
Olivier Finkel, Pierre Simonnet
On Recognizable Tree Languages Beyond the Borel Hierarchy CoRR (2009)
Olivier Finkel, Dominique Lecomte
Classical and effective descriptive complexities of omega-powers. Ann. Pure Appl. Log. 160 (2) (2009)
Olivier Finkel, Pierre Simonnet
On Recognizable Tree Languages Beyond the Borel Hierarchy. Fundam. Informaticae 95 (2-3) (2009)
Olivier Finkel
On Recognizable Languages of Infinite Pictures CoRR (2009)
Olivier Finkel
Highly Undecidable Problems For Infinite Computations CoRR (2009)
Olivier Finkel
Highly Undecidable Problems For Infinite Computations. RAIRO Theor. Informatics Appl. 43 (2) (2009)
Olivier Finkel, Dominique Lecomte
Decision problems for Turing machines. Inf. Process. Lett. 109 (23-24) (2009)
Olivier Finkel
Highly Undecidable Problems about Recognizability by Tiling Systems. Fundam. Informaticae 91 (2) (2009)
Olivier Finkel, Dominique Lecomte
Decision Problems For Turing Machines CoRR (2009)
Olivier Finkel
On Some Sets of Dictionaries Whose omega-Powers Have a Given Complexity CoRR (2009)
Olivier Finkel
The Complexity of Infinite Computations In Models of Set Theory Log. Methods Comput. Sci. 5 (4) (2009)
Olivier Finkel
On Decidability Properties of One-Dimensional Cellular Automata CoRR (2009)
Olivier Finkel, Dominique Lecomte
Topological Complexity of omega-Powers: Extended Abstract. Topological and Game-Theoretic Aspects of Infinite Computations (2008)
Olivier Finkel
-languages. Arch. Math. Log. 47 (6) (2008)
Olivier Finkel
On the Topological Complexity of Infinitary Rational Relations CoRR (2008)
Olivier Finkel, Pierre Simonnet
Topology and Ambiguity in Omega Context Free Languages CoRR (2008)
Olivier Finkel, Jean-Pierre Ressayre, Pierre Simonnet
On Infinite Real Trace Rational Languages of Maximum Topological Complexity CoRR (2008)
Olivier Carton, Olivier Finkel, Pierre Simonnet
On the Continuity Set of an omega Rational Function CoRR (2008)
Olivier Carton, Olivier Finkel, Pierre Simonnet
On the continuity set of an Omega rational function. RAIRO Theor. Informatics Appl. 42 (1) (2008)
Olivier Finkel, Dominique Lecomte
Topological Complexity of omega-Powers : Extended Abstract CoRR (2008)
Olivier Finkel
Wadge Degrees of Infinitary Rational Relations. Math. Comput. Sci. 2 (1) (2008)
Olivier Finkel
Topological Complexity of Context-Free omega-Languages: A Survey CoRR (2008)
Olivier Finkel
Closure Properties of Locally Finite Omega Languages CoRR (2008)
Jacques Duparc, Olivier Finkel
An omega-power of a context-free language which is Borel above Delta^0_omega CoRR (2008)
Olivier Finkel
On the Length of the Wadge Hierarchy of Omega Context Free Languages CoRR (2008)
Olivier Finkel
Highly Undecidable Problems about Recognizability by Tiling Systems CoRR (2008)
Olivier Finkel
Wadge Degrees of Infinitary Rational Relations CoRR (2008)
Olivier Finkel
An omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank CoRR (2008)
Olivier Finkel
On Winning Conditions of High Borel Complexity in Pushdown Games CoRR (2008)
Olivier Finkel, Stevo Todorcevic
Local sentences and Mahlo cardinals. Math. Log. Q. 53 (6) (2007)
Olivier Finkel
On Decidability Properties of Local Sentences CoRR (2007)
Olivier Finkel
-complete Infinitary Rational Relation. Comput. Sci. J. Moldova 15 (1) (2007)
Olivier Finkel
Undecidable Problems About Timed Automata CoRR (2007)
Olivier Finkel
On the Accepting Power of 2-Tape Büchi Automata CoRR (2007)
Olivier Finkel, Dominique Lecomte
Classical and Effective Descriptive Complexities of omega-Powers CoRR (2007)
Olivier Finkel
Borel Ranks and Wadge Degrees of Context Free Omega Languages CoRR (2007)
Dominique Lecomte, Olivier Finkel
There Exist some Omega-Powers of Any Borel Rank CoRR (2007)
Olivier Finkel, Dominique Lecomte
-Powers of Any Borel Rank. CSL (2007)
Olivier Finkel
An Example of Pi^0_3-complete Infinitary Rational Relation CoRR (2007)
Olivier Finkel
Undecidable Problems About Timed Automata. FORMATS (2006)
Olivier Finkel
On the Accepting Power of 2-Tape Büchi Automata. STACS (2006)
Olivier Finkel
On the Shuffle of Regular Timed Languages. Bull. EATCS 88 (2006)
Olivier Finkel
On decidability properties of local sentences. Theor. Comput. Sci. 364 (2) (2006)
Olivier Finkel
Borel ranks and Wadge degrees of context free omega-languages. Math. Struct. Comput. Sci. 16 (5) (2006)
Olivier Finkel
On Winning Conditions of High Borel Complexity in Pushdown Games. Fundam. Informaticae 66 (3) (2005)
Olivier Finkel
On Decision Problems for Timed Automata. Bull. EATCS 87 (2005)
Olivier Finkel
On Decidability Properties of Local Sentences. Electron. Notes Theor. Comput. Sci. 123 (2005)
Olivier Finkel
Borel Ranks and Wadge Degrees of Context Free omega-Languages. CiE (2005)
Olivier Finkel
On the Length of the Wadge Hierarchy of ω-Context Free Languages. J. Autom. Lang. Comb. 10 (4) (2005)

Olivier Finkel.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Olivier Finkel