| Publication | Date of Publication | Type |
|---|
Some regular -powers in the Hausdorff-Kuratowski hierarchy
Theoretical Computer Science | 2026-04-16 | Paper |
Toward higher-order infinite time Turing machines: simulational -machines
Annals of Pure and Applied Logic | 2026-04-15 | Paper |
Wadge degrees of \(\mathbf{\Delta}^0_2\) omega-powers
Mathematical Logic Quarterly (MLQ) | 2024-11-22 | Paper |
On bi-infinite and conjugate post correspondence problems
RAIRO - Theoretical Informatics and Applications | 2024-02-02 | Paper |
Two Effective Properties of ω-Rational Functions
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
On the high complexity of Petri nets -languages
Application and Theory of Petri Nets and Concurrency | 2022-09-01 | Paper |
On the expressive power of non-deterministic and unambiguous Petri nets over infinite words
Fundamenta Informaticae | 2022-02-01 | Paper |
Descriptive set theory and -powers of finitary languages
(available as arXiv preprint) | 2021-08-03 | Paper |
Some complete -powers of a one-counter language, for any Borel class of finite rank
Archive for Mathematical Logic | 2021-01-19 | Paper |
The automatic Baire property and an effective property of -rational functions
(available as arXiv preprint) | 2020-07-27 | Paper |
| scientific article; zbMATH DE number 7204314 (Why is no real title available?) | 2020-05-26 | Paper |
Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words
International Journal of Foundations of Computer Science | 2019-06-21 | Paper |
Polishness of some topologies related to word or tree automata
(available as arXiv preprint) | 2019-05-17 | Paper |
Computational capabilities of analog and evolving neural networks over infinite input streams
Journal of Computer and System Sciences | 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
Lecture Notes in Computer Science | 2017-05-19 | Paper |
Locally finite -languages and effective analytic sets have the same topological complexity
Mathematical Logic Quarterly (MLQ) | 2016-10-24 | Paper |
Infinite games specified by 2-tape automata
Annals of Pure and Applied Logic | 2016-10-10 | Paper |
The Wadge hierarchy of Petri nets \(\omega\)-languages
Logical Foundations of Computer Science | 2015-12-11 | Paper |
Incompleteness theorems, large cardinals, and automata over infinite words
Automata, Languages, and Programming | 2015-11-04 | Paper |
An upper bound on the complexity of recognizable tree languages
RAIRO - Theoretical Informatics and Applications | 2015-08-14 | Paper |
The exact complexity of the infinite Post Correspondence Problem
Information Processing Letters | 2015-05-21 | Paper |
| The Wadge hierarchy of Petri nets \(\omega\)-languages | 2015-04-09 | Paper |
Topological complexity of context-free -languages: a survey
Lecture Notes in Computer Science | 2015-02-10 | Paper |
Ambiguity of -languages of Turing machines
Logical Methods in Computer Science | 2014-09-05 | Paper |
On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets
Information Processing Letters | 2014-04-15 | Paper |
On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets
Information Processing Letters | 2014-04-15 | Paper |
The determinacy of context-free games
The Journal of Symbolic Logic | 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
International Journal of Foundations of Computer Science | 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
Journal of Symbolic Logic | 2012-04-19 | Paper |
A hierarchy of tree-automatic structures
Journal of Symbolic Logic | 2012-04-19 | Paper |
Some problems in automata theory which depend on the models of set theory
RAIRO - Theoretical Informatics and Applications | 2012-02-28 | Paper |
Some problems in automata theory which depend on the models of set theory
RAIRO - Theoretical Informatics and Applications | 2012-02-28 | Paper |
Decision problems for recognizable languages of infinite pictures
(available as arXiv preprint) | 2011-10-05 | Paper |
| On decidability properties of one-dimensional cellular automata | 2011-05-18 | Paper |
On some sets of dictionaries whose -powers have a given complexity
Mathematical Logic Quarterly | 2010-11-04 | Paper |
The isomorphism relation between tree-automatic structures
Central European Journal of Mathematics | 2010-10-08 | Paper |
Decision problems for Turing machines
Information Processing Letters | 2010-09-02 | Paper |
On recognizable tree languages beyond the Borel hierarchy
Fundamenta Informaticae | 2010-02-05 | Paper |
The Complexity of Infinite Computations In Models of Set Theory
Logical Methods in Computer Science | 2010-01-28 | Paper |
| scientific article; zbMATH DE number 5605085 (Why is no real title available?) | 2009-09-19 | Paper |
| scientific article; zbMATH DE number 5605076 (Why is no real title available?) | 2009-09-19 | Paper |
Classical and effective descriptive complexities of \(\omega \)-powers
Annals of Pure and Applied Logic | 2009-08-05 | Paper |
Highly Undecidable Problems about Recognizability by Tiling Systems
Fundamenta Informaticae | 2009-06-23 | Paper |
Highly Undecidable Problems For Infinite Computations
RAIRO - Theoretical Informatics and Applications | 2009-05-06 | Paper |
Highly Undecidable Problems For Infinite Computations
RAIRO - Theoretical Informatics and Applications | 2009-05-06 | Paper |
There Exist Some ω-Powers of Any Borel Rank
Computer Science Logic | 2009-03-05 | Paper |
Wadge degrees of infinitary rational relations
Mathematics in Computer Science | 2009-02-17 | Paper |
Wadge degrees of infinitary rational relations
Mathematics in Computer Science | 2009-02-17 | Paper |
Topological complexity of locally finite \(\omega\)-languages
Archive for Mathematical Logic | 2008-09-12 | Paper |
On the continuity set of an Omega rational function
RAIRO - Theoretical Informatics and Applications | 2008-07-21 | Paper |
On the continuity set of an Omega rational function
RAIRO - Theoretical Informatics and Applications | 2008-07-21 | Paper |
Undecidable Problems About Timed Automata
Lecture Notes in Computer Science | 2008-07-08 | Paper |
| An \(\omega\)-power of a context-free language which is Borel above \(\Delta^0_{\omega}\) | 2008-07-01 | Paper |
Topological Complexity of Context-Free omega-Languages: A Survey
(available as arXiv preprint) | 2008-06-09 | Paper |
On the Accepting Power of 2-Tape Büchi Automata
STACS 2006 | 2008-03-19 | Paper |
| On the length of the Wadge hierarchy of -context-free languages | 2008-01-18 | Paper |
Local sentences and Mahlo cardinals
Mathematical Logic Quarterly | 2008-01-04 | Paper |
An example of \(\boldsymbol{\Pi}_3^0\)-complete infinitary rational relation
Computer Science Journal of Moldova | 2007-08-20 | Paper |
Borel ranks and Wadge degrees of context free \omega-languages
Mathematical Structures in Computer Science | 2007-02-09 | Paper |
On decidability properties of local sentences
Theoretical Computer Science | 2007-01-09 | Paper |
| On winning conditions of high Borel complexity in pushdown games | 2006-06-19 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
| scientific article; zbMATH DE number 2187727 (Why is no real title available?) | 2005-07-20 | Paper |
Topology and ambiguity in \(\omega\)-context free languages
Bulletin of the Belgian Mathematical Society - Simon Stevin | 2005-06-09 | Paper |
| scientific article; zbMATH DE number 2140432 (Why is no real title available?) | 2005-03-03 | Paper |
ON RECOGNIZABLE LANGUAGES OF INFINITE PICTURES
International Journal of Foundations of Computer Science | 2005-02-28 | Paper |
Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations
RAIRO - Theoretical Informatics and Applications | 2004-10-28 | Paper |
Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations
RAIRO - Theoretical Informatics and Applications | 2004-10-28 | Paper |
On the Topological Complexity of Infinitary Rational Relations
RAIRO - Theoretical Informatics and Applications | 2004-10-28 | Paper |
On the Topological Complexity of Infinitary Rational Relations
RAIRO - Theoretical Informatics and Applications | 2004-10-28 | Paper |
On the Topological Complexity of Infinitary Rational Relations
RAIRO - Theoretical Informatics and Applications | 2004-10-28 | Paper |
Closure properties of locally finite \(\omega\)-languages
Theoretical Computer Science | 2004-10-27 | Paper |
| scientific article; zbMATH DE number 2040947 (Why is no real title available?) | 2004-02-11 | Paper |
Borel hierarchy and omega context free languages.
Theoretical Computer Science | 2003-08-17 | Paper |
Ambiguity in omega context free languages
Theoretical Computer Science | 2003-07-30 | Paper |
On omega context free languages which are Borel sets of infinite rank.
Theoretical Computer Science | 2003-05-25 | Paper |
| scientific article; zbMATH DE number 1841831 (Why is no real title available?) | 2002-12-04 | Paper |
Topological properties of omega context-free languages
Theoretical Computer Science | 2002-03-03 | Paper |
Wadge hierarchy of omega context-free languages
Theoretical Computer Science | 2002-03-03 | Paper |
Locally finite languages
Theoretical Computer Science | 2001-08-20 | Paper |
Computer science and the fine structure of Borel sets
Theoretical Computer Science | 2001-08-20 | Paper |
Stretchings
Journal of Symbolic Logic | 1996-11-24 | Paper |
| scientific article; zbMATH DE number 4139726 (Why is no real title available?) | 1989-01-01 | Paper |
