Publication | Date of Publication | Type |
---|
On bi-infinite and conjugate post correspondence problems | 2024-02-02 | Paper |
Two Effective Properties of ω-Rational Functions | 2023-08-15 | Paper |
On the High Complexity of Petri Nets $$\omega $$-Languages | 2022-09-01 | Paper |
On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words | 2022-02-01 | Paper |
Descriptive Set Theory and $\omega$-Powers of Finitary Languages | 2021-08-03 | Paper |
Some complete \(\omega\)-powers of a one-counter language, for any Borel class of finite rank | 2021-01-19 | Paper |
The automatic Baire property and an effective property of \(\omega\)-rational functions | 2020-07-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q5111190 | 2020-05-26 | Paper |
Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words | 2019-06-21 | Paper |
Polishness of some topologies related to word or tree automata | 2019-05-17 | Paper |
Computational capabilities of analog and evolving neural networks over infinite input streams | 2019-01-25 | Paper |
Wadge Degrees of $\omega$-Languages of Petri Nets | 2017-12-20 | Paper |
Expressive power of evolving neural networks working on infinite input streams | 2017-11-22 | Paper |
Incompleteness Theorems, Large Cardinals, and Automata over Finite Words | 2017-05-19 | Paper |
Locally finite ω-languages and effective analytic sets have the same topological complexity | 2016-10-24 | Paper |
Infinite games specified by 2-tape automata | 2016-10-10 | Paper |
The Wadge Hierarchy of Petri Nets ω-Languages | 2015-12-11 | Paper |
Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words | 2015-11-04 | Paper |
An upper bound on the complexity of recognizable tree languages | 2015-08-14 | Paper |
The exact complexity of the infinite Post Correspondence Problem | 2015-05-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q4982345 | 2015-04-09 | Paper |
Topological Complexity of Context-Free ω-Languages: A Survey | 2015-02-10 | Paper |
Ambiguity of {\omega}-Languages of Turing Machines | 2014-09-05 | Paper |
On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets | 2014-04-15 | Paper |
The Determinacy of Context-Free Games | 2014-04-04 | Paper |
The Determinacy of Context-Free Games | 2013-12-12 | Paper |
THREE APPLICATIONS TO RATIONAL RELATIONS OF THE HIGH UNDECIDABILITY OF THE INFINITE POST CORRESPONDENCE PROBLEM IN A REGULAR ω-LANGUAGE | 2013-06-06 | Paper |
The Determinacy of Context-Free Games | 2012-08-23 | Paper |
Automatic Ordinals | 2012-05-08 | Paper |
A hierarchy of tree-automatic structures | 2012-04-19 | Paper |
Some problems in automata theory which depend on the models of set theory | 2012-02-28 | Paper |
Decision Problems for Recognizable Languages of Infinite Pictures | 2011-10-05 | Paper |
https://portal.mardi4nfdi.de/entity/Q2998116 | 2011-05-18 | Paper |
On some sets of dictionaries whose ω -powers have a given | 2010-11-04 | Paper |
The isomorphism relation between tree-automatic structures | 2010-10-08 | Paper |
Decision problems for Turing machines | 2010-09-02 | Paper |
On Recognizable Tree Languages Beyond the Borel Hierarchy | 2010-02-05 | Paper |
The Complexity of Infinite Computations In Models of Set Theory | 2010-01-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q3396573 | 2009-09-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q3396582 | 2009-09-19 | Paper |
Classical and effective descriptive complexities of \(\omega \)-powers | 2009-08-05 | Paper |
Highly Undecidable Problems about Recognizability by Tiling Systems | 2009-06-23 | Paper |
Highly Undecidable Problems For Infinite Computations | 2009-05-06 | Paper |
There Exist Some ω-Powers of Any Borel Rank | 2009-03-05 | Paper |
Wadge degrees of infinitary rational relations | 2009-02-17 | Paper |
Topological complexity of locally finite \(\omega\)-languages | 2008-09-12 | Paper |
On the continuity set of an Omega rational function | 2008-07-21 | Paper |
Undecidable Problems About Timed Automata | 2008-07-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q3509076 | 2008-07-01 | Paper |
Topological Complexity of Context-Free omega-Languages: A Survey | 2008-06-09 | Paper |
On the Accepting Power of 2-Tape Büchi Automata | 2008-03-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q5437182 | 2008-01-18 | Paper |
Local sentences and Mahlo cardinals | 2008-01-04 | Paper |
An example of \(\boldsymbol{\Pi}_3^0\)-complete infinitary rational relation | 2007-08-20 | Paper |
Borel ranks and Wadge degrees of context free $\omega$-languages | 2007-02-09 | Paper |
On decidability properties of local sentences | 2007-01-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q5472876 | 2006-06-19 | Paper |
New Computational Paradigms | 2006-01-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q5460926 | 2005-07-20 | Paper |
Topology and ambiguity in \(\omega\)-context free languages | 2005-06-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q4654268 | 2005-03-03 | Paper |
ON RECOGNIZABLE LANGUAGES OF INFINITE PICTURES | 2005-02-28 | Paper |
On the Topological Complexity of Infinitary Rational Relations | 2004-10-28 | Paper |
Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations | 2004-10-28 | Paper |
Closure properties of locally finite \(\omega\)-languages | 2004-10-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q4452098 | 2004-02-11 | Paper |
Borel hierarchy and omega context free languages. | 2003-08-17 | Paper |
Ambiguity in omega context free languages | 2003-07-30 | Paper |
On omega context free languages which are Borel sets of infinite rank. | 2003-05-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q4783319 | 2002-12-04 | Paper |
Topological properties of omega context-free languages | 2002-03-03 | Paper |
Wadge hierarchy of omega context-free languages | 2002-03-03 | Paper |
Locally finite languages | 2001-08-20 | Paper |
Computer science and the fine structure of Borel sets | 2001-08-20 | Paper |
Stretchings | 1996-11-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q3472087 | 1989-01-01 | Paper |