Olivier Finkel

CoRR, 2024

2023

On bi-infinite and conjugate post correspondence problems.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2023

2021

Two Effective Properties of ω-Rational Functions.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2021

On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words.

[BibT_eX]

[DOI]

Michal Skrzypczak

Fundam. Informaticae, 2021

Some complete ømega-powers of a one-counter language, for any Borel class of finite rank.

[BibT_eX]

[DOI]

Arch. Math. Log., 2021

2020

Descriptive Set Theory and ω-Powers of Finitary Languages.

[BibT_eX]

[DOI]

CoRR, 2020

Some complete ω-powers of a one-counter language, for any Borel class of finite rank.

[BibT_eX]

[DOI]

CoRR, 2020

The Automatic Baire Property and an Effective Property of ømega-Rational Functions.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2020

On the High Complexity of Petri Nets ømega-Languages.

[BibT_eX]

[DOI]

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2020

2019

Polishness of some topologies related to word or tree automata.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2019

Computational capabilities of analog and evolving neural networks over infinite input streams.

[BibT_eX]

[DOI]

Jérémie Cabessa

J. Comput. Syst. Sci., 2019

Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2019

2018

An Effective Property of ω-Rational Functions.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Wadge Degrees of ω-Languages of Petri Nets.

[BibT_eX]

[DOI]

CoRR, 2017

Polishness of some topologies related to automata (Extended version).

[BibT_eX]

[DOI]

CoRR, 2017

Expressive Power of Evolving Neural Networks Working on Infinite Input Streams.

[BibT_eX]

[DOI]

Jérémie Cabessa

Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

Polishness of Some Topologies Related to Automata.

[BibT_eX]

[DOI]

Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

2016

Locally finite ω-languages and effective analytic sets have the same topological complexity.

[BibT_eX]

[DOI]

Math. Log. Q., 2016

Infinite games specified by 2-tape automata.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2016

2015

An upper bound on the complexity of recognizable tree languages.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2015

The exact complexity of the infinite Post Correspondence Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

On the topological complexity of ω-languages of non-deterministic Petri nets.

[BibT_eX]

[DOI]

Michal Skrzypczak

Inf. Process. Lett., 2014

Ambiguity of omega-Languages of Turing Machines

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2014

On the Topological Complexity of omega-Languages of Non-Deterministic Petri Nets.

[BibT_eX]

[DOI]

Michal Skrzypczak

CoRR, 2014

Topological Complexity of Context-Free ω-Languages: A Survey.

[BibT_eX]

[DOI]

Proceedings of the Language, Culture, Computation. Computing - Theory and Technology, 2014

The wadge hierarchy of Petri Nets ω-languages.

[BibT_eX]

[DOI]

Proceedings of the Logic, Computation, Hierarchies, 2014

2013

The determinacy of context-free games.

[BibT_eX]

[DOI]

J. Symb. Log., 2013

Automatic Ordinals.

[BibT_eX]

[DOI]

Int. J. Unconv. Comput., 2013

The Wadge Hierarchy of Petri Nets ω-Languages.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2013

2012

A hierarchy of tree-automatic structures.

[BibT_eX]

[DOI]

J. Symb. Log., 2012

Three Applications to Rational Relations of the High Undecidability of the Infinite Post Correspondence Problem in a Regular ω-Language.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

2011

On Decidability Properties of One-Dimensional Cellular Automata.

[BibT_eX]

[DOI]

J. Cell. Autom., 2011

Some problems in automata theory which depend on the models of set theory.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2011

Decision Problems for Recognizable Languages of Infinite Pictures

[BibT_eX]

[DOI]

CoRR, 2011

Three Applications to Rational Relations of the High Undecidability of the Infinite Post Correspondence Problem in a Regular omega-Language.

[BibT_eX]

[DOI]

CoRR, 2011

2010

On some sets of dictionaries whose omega -powers have a given.

[BibT_eX]

[DOI]

Math. Log. Q., 2010

The Isomorphism Relation Between Tree-Automatic Structures

[BibT_eX]

[DOI]

CoRR, 2010

2009

Highly Undecidable Problems For Infinite Computations.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2009

Decision problems for Turing machines.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

On Recognizable Tree Languages Beyond the Borel Hierarchy.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2009

Highly Undecidable Problems about Recognizability by Tiling Systems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2009

On Some Sets of Dictionaries Whose omega-Powers Have a Given Complexity

[BibT_eX]

[DOI]

CoRR, 2009

The Complexity of Infinite Computations In Models of Set Theory

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2009

Classical and effective descriptive complexities of omega-powers.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2009

2008

Wadge Degrees of Infinitary Rational Relations.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2008

On the continuity set of an Omega rational function.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2008

Topological Complexity of Context-Free omega-Languages: A Survey

[BibT_eX]

[DOI]

CoRR, 2008

An omega-power of a context-free language which is Borel above Delta^0_omega

[BibT_eX]

[DOI]

CoRR, 2008

On Infinite Real Trace Rational Languages of Maximum Topological Complexity

[BibT_eX]

[DOI]

CoRR, 2008

On the Length of the Wadge Hierarchy of Omega Context Free Languages

[BibT_eX]

[DOI]

CoRR, 2008

Topology and Ambiguity in Omega Context Free Languages

[BibT_eX]

[DOI]

CoRR, 2008

Topological complexity of locally finite omega -languages.

[BibT_eX]

[DOI]

Arch. Math. Log., 2008

Topological Complexity of omega-Powers: Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the Topological and Game-Theoretic Aspects of Infinite Computations, 29.06., 2008

2007

Local sentences and Mahlo cardinals.

[BibT_eX]

[DOI]

Math. Log. Q., 2007

An Example of ∏03-complete Infinitary Rational Relation.

[BibT_eX]

[DOI]

Comput. Sci. J. Moldova, 2007

An Example of Pi^0_3-complete Infinitary Rational Relation

[BibT_eX]

[DOI]

CoRR, 2007

There Exist some Omega-Powers of Any Borel Rank

[BibT_eX]

[DOI]

CoRR, 2007

There Exist Some omega -Powers of Any Borel Rank.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006

On decidability properties of local sentences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Borel ranks and Wadge degrees of context free omega-languages.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2006

On the Shuffle of Regular Timed Languages.

[BibT_eX]

Bull. EATCS, 2006

On the Accepting Power of 2-Tape Büchi Automata.

[BibT_eX]

[DOI]

Proceedings of the STACS 2006, 2006

Undecidable Problems About Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2006

2005

On the Length of the Wadge Hierarchy of ω-Context Free Languages.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2005

On Winning Conditions of High Borel Complexity in Pushdown Games.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2005

On Decision Problems for Timed Automata.

[BibT_eX]

Bull. EATCS, 2005

2004

Closure properties of locally finite omega-languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

On Recognizable Languages Of Infinite Pictures.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2004

An omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2004

2003

On omega context free languages which are Borel sets of infinite rank.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Ambiguity in omega context free languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Borel hierarchy and omega context free languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2003

On the Topological Complexity of Infinitary Rational Relations.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2003

On Infinitary Rational Relations and Borel Sets.

[BibT_eX]

[DOI]

Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

2001

Wadge hierarchy of omega context-free languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Topological properties of omega context-free languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Locally finite languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Computer science and the fine structure of Borel sets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

An Effective Extension of the Wagner Hierarchy to Blind Counter Automata.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 15th International Workshop, 2001

1996

Stretchings.

[BibT_eX]

[DOI]