Olivier Finkel

According to our database1, Olivier Finkel authored at least 58 papers between 1996 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.



In proceedings 
PhD thesis 



On csauthors.net:


Computational capabilities of analog and evolving neural networks over infinite input streams.
J. Comput. Syst. Sci., 2019

Incompleteness Theorems, Large Cardinals, and Automata over Finite Words.
Proceedings of the Theory and Applications of Models of Computation, 2017

Expressive Power of Evolving Neural Networks Working on Infinite Input Streams.
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

Polishness of Some Topologies Related to Automata.
Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

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

Infinite games specified by 2-tape automata.
Ann. Pure Appl. Logic, 2016

An upper bound on the complexity of recognizable tree languages.
RAIRO - Theor. Inf. and Applic., 2015

The exact complexity of the infinite Post Correspondence Problem.
Inf. Process. Lett., 2015

Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

On the topological complexity of ω-languages of non-deterministic Petri nets.
Inf. Process. Lett., 2014

Ambiguity of omega-Languages of Turing Machines
Logical Methods in Computer Science, 2014

Topological Complexity of Context-Free ω-Languages: A Survey.
Proceedings of the Language, Culture, Computation. Computing - Theory and Technology, 2014

The wadge hierarchy of Petri Nets ω-languages.
Proceedings of the Logic, Computation, Hierarchies, 2014

Automatic Ordinals.
IJUC, 2013

The Wadge Hierarchy of Petri Nets ω-Languages.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2013

A hierarchy of tree-automatic structures.
J. Symb. Log., 2012

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

The Determinacy of Context-Free Games.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

On Decidability Properties of One-Dimensional Cellular Automata.
J. Cellular Automata, 2011

Some problems in automata theory which depend on the models of set theory.
RAIRO - Theor. Inf. and Applic., 2011

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

Highly Undecidable Problems For Infinite Computations.
ITA, 2009

Decision problems for Turing machines.
Inf. Process. Lett., 2009

On Recognizable Tree Languages Beyond the Borel Hierarchy.
Fundam. Inform., 2009

Highly Undecidable Problems about Recognizability by Tiling Systems.
Fundam. Inform., 2009

The Complexity of Infinite Computations In Models of Set Theory
Logical Methods in Computer Science, 2009

Classical and effective descriptive complexities of omega-powers.
Ann. Pure Appl. Logic, 2009

Wadge Degrees of Infinitary Rational Relations.
Mathematics in Computer Science, 2008

On the continuity set of an Omega rational function.
ITA, 2008

Topological complexity of locally finite omega -languages.
Arch. Math. Log., 2008

Topological Complexity of omega-Powers: Extended Abstract.
Proceedings of the Topological and Game-Theoretic Aspects of Infinite Computations, 29.06., 2008

Local sentences and Mahlo cardinals.
Math. Log. Q., 2007

An Example of ∏03-complete Infinitary Rational Relation.
The Computer Science Journal of Moldova, 2007

There Exist Some omega -Powers of Any Borel Rank.
Proceedings of the Computer Science Logic, 21st International Workshop, 2007

On decidability properties of local sentences.
Theor. Comput. Sci., 2006

On the Shuffle of Regular Timed Languages.
Bulletin of the EATCS, 2006

On the Accepting Power of 2-Tape Büchi Automata.
Proceedings of the STACS 2006, 2006

Undecidable Problems About Timed Automata.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2006

On the Length of the Wadge Hierarchy of ω-Context Free Languages.
Journal of Automata, Languages and Combinatorics, 2005

On Winning Conditions of High Borel Complexity in Pushdown Games.
Fundam. Inform., 2005

On Decidability Properties of Local Sentences.
Electr. Notes Theor. Comput. Sci., 2005

On Decision Problems for Timed Automata.
Bulletin of the EATCS, 2005

Borel Ranks and Wadge Degrees of Context Free omega-Languages.
Proceedings of the New Computational Paradigms, 2005

Closure properties of locally finite omega-languages.
Theor. Comput. Sci., 2004

On Recognizable Languages Of Infinite Pictures.
Int. J. Found. Comput. Sci., 2004

An omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank.
Fundam. Inform., 2004

On omega context free languages which are Borel sets of infinite rank.
Theor. Comput. Sci., 2003

Ambiguity in omega context free languages.
Theor. Comput. Sci., 2003

Borel hierarchy and omega context free languages.
Theor. Comput. Sci., 2003

Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations.
ITA, 2003

On the Topological Complexity of Infinitary Rational Relations.
ITA, 2003

On Infinitary Rational Relations and Borel Sets.
Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

Wadge hierarchy of omega context-free languages.
Theor. Comput. Sci., 2001

Topological properties of omega context-free languages.
Theor. Comput. Sci., 2001

Locally finite languages.
Theor. Comput. Sci., 2001

Computer science and the fine structure of Borel sets.
Theor. Comput. Sci., 2001

An Effective Extension of the Wagner Hierarchy to Blind Counter Automata.
Proceedings of the Computer Science Logic, 15th International Workshop, 2001

J. Symb. Log., 1996