Olivier Finkel

From MaRDI portal
Revision as of 11:36, 28 January 2024 by Import240128110107 (talk | contribs) (Created automatically from import240128110107)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:324244

Available identifiers

zbMath Open finkel.olivierMaRDI QIDQ324244

List of research outcomes





PublicationDate of PublicationType
Wadge degrees of \(\mathbf{\Delta}^0_2\) omega-powers2024-11-22Paper
On bi-infinite and conjugate post correspondence problems2024-02-02Paper
Two Effective Properties of ω-Rational Functions2023-08-15Paper
On the High Complexity of Petri Nets $$\omega $$-Languages2022-09-01Paper
On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words2022-02-01Paper
Descriptive Set Theory and $\omega$-Powers of Finitary Languages2021-08-03Paper
Some complete \(\omega\)-powers of a one-counter language, for any Borel class of finite rank2021-01-19Paper
The automatic Baire property and an effective property of \(\omega\)-rational functions2020-07-27Paper
https://portal.mardi4nfdi.de/entity/Q51111902020-05-26Paper
Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words2019-06-21Paper
Polishness of some topologies related to word or tree automata2019-05-17Paper
Computational capabilities of analog and evolving neural networks over infinite input streams2019-01-25Paper
Wadge Degrees of $\omega$-Languages of Petri Nets2017-12-20Paper
Expressive power of evolving neural networks working on infinite input streams2017-11-22Paper
Incompleteness Theorems, Large Cardinals, and Automata over Finite Words2017-05-19Paper
Locally finite ω-languages and effective analytic sets have the same topological complexity2016-10-24Paper
Infinite games specified by 2-tape automata2016-10-10Paper
The Wadge Hierarchy of Petri Nets ω-Languages2015-12-11Paper
Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words2015-11-04Paper
An upper bound on the complexity of recognizable tree languages2015-08-14Paper
The exact complexity of the infinite Post Correspondence Problem2015-05-21Paper
https://portal.mardi4nfdi.de/entity/Q49823452015-04-09Paper
Topological Complexity of Context-Free ω-Languages: A Survey2015-02-10Paper
Ambiguity of {\omega}-Languages of Turing Machines2014-09-05Paper
On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets2014-04-15Paper
The Determinacy of Context-Free Games2014-04-04Paper
The Determinacy of Context-Free Games2013-12-12Paper
THREE APPLICATIONS TO RATIONAL RELATIONS OF THE HIGH UNDECIDABILITY OF THE INFINITE POST CORRESPONDENCE PROBLEM IN A REGULAR ω-LANGUAGE2013-06-06Paper
The Determinacy of Context-Free Games2012-08-23Paper
Automatic Ordinals2012-05-08Paper
A hierarchy of tree-automatic structures2012-04-19Paper
Some problems in automata theory which depend on the models of set theory2012-02-28Paper
Decision Problems for Recognizable Languages of Infinite Pictures2011-10-05Paper
https://portal.mardi4nfdi.de/entity/Q29981162011-05-18Paper
On some sets of dictionaries whose ω -powers have a given2010-11-04Paper
The isomorphism relation between tree-automatic structures2010-10-08Paper
Decision problems for Turing machines2010-09-02Paper
On Recognizable Tree Languages Beyond the Borel Hierarchy2010-02-05Paper
The Complexity of Infinite Computations In Models of Set Theory2010-01-28Paper
https://portal.mardi4nfdi.de/entity/Q33965732009-09-19Paper
https://portal.mardi4nfdi.de/entity/Q33965822009-09-19Paper
Classical and effective descriptive complexities of \(\omega \)-powers2009-08-05Paper
Highly Undecidable Problems about Recognizability by Tiling Systems2009-06-23Paper
Highly Undecidable Problems For Infinite Computations2009-05-06Paper
There Exist Some ω-Powers of Any Borel Rank2009-03-05Paper
Wadge degrees of infinitary rational relations2009-02-17Paper
Topological complexity of locally finite \(\omega\)-languages2008-09-12Paper
On the continuity set of an Omega rational function2008-07-21Paper
Undecidable Problems About Timed Automata2008-07-08Paper
https://portal.mardi4nfdi.de/entity/Q35090762008-07-01Paper
Topological Complexity of Context-Free omega-Languages: A Survey2008-06-09Paper
On the Accepting Power of 2-Tape Büchi Automata2008-03-19Paper
https://portal.mardi4nfdi.de/entity/Q54371822008-01-18Paper
Local sentences and Mahlo cardinals2008-01-04Paper
An example of \(\boldsymbol{\Pi}_3^0\)-complete infinitary rational relation2007-08-20Paper
Borel ranks and Wadge degrees of context free $\omega$-languages2007-02-09Paper
On decidability properties of local sentences2007-01-09Paper
https://portal.mardi4nfdi.de/entity/Q54728762006-06-19Paper
New Computational Paradigms2006-01-11Paper
https://portal.mardi4nfdi.de/entity/Q54609262005-07-20Paper
Topology and ambiguity in \(\omega\)-context free languages2005-06-09Paper
https://portal.mardi4nfdi.de/entity/Q46542682005-03-03Paper
ON RECOGNIZABLE LANGUAGES OF INFINITE PICTURES2005-02-28Paper
On the Topological Complexity of Infinitary Rational Relations2004-10-28Paper
Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations2004-10-28Paper
Closure properties of locally finite \(\omega\)-languages2004-10-27Paper
https://portal.mardi4nfdi.de/entity/Q44520982004-02-11Paper
Borel hierarchy and omega context free languages.2003-08-17Paper
Ambiguity in omega context free languages2003-07-30Paper
On omega context free languages which are Borel sets of infinite rank.2003-05-25Paper
https://portal.mardi4nfdi.de/entity/Q47833192002-12-04Paper
Topological properties of omega context-free languages2002-03-03Paper
Wadge hierarchy of omega context-free languages2002-03-03Paper
Locally finite languages2001-08-20Paper
Computer science and the fine structure of Borel sets2001-08-20Paper
Stretchings1996-11-24Paper
https://portal.mardi4nfdi.de/entity/Q34720871989-01-01Paper

Research outcomes over time

This page was built for person: Olivier Finkel