| Publication | Date of Publication | Type |
|---|
Positionality in _0² and a completeness result
Logical Methods in Computer Science | 2026-05-29 | Paper |
| Deterministic and game separability for regular languages of infinite trees | 2026-05-12 | Paper |
| On the succinctness of alternating parity good-for-games automata | 2026-03-23 | Paper |
| Computing measures of weak-mso definable sets of trees | 2026-03-18 | Paper |
| The probabilistic Rabin tree theorem | 2026-02-27 | Paper |
| Positionality in ^0_2 and a completeness result | 2025-11-10 | Paper |
| Languages given by finite automata over the unary alphabet | 2025-07-28 | Paper |
| Uniformisation of regular relations in first-order logic with two variables | 2025-06-18 | Paper |
Languages given by finite automata over the unary alphabet
Journal of Computer and System Sciences | 2025-03-26 | Paper |
| MSO+\( \nabla \) is undecidable | 2024-12-19 | Paper |
| On Guidable Index of Tree Automata | 2023-08-08 | Paper |
| Languages given by Finite Automata over the Unary Alphabet | 2023-02-13 | Paper |
| scientific article; zbMATH DE number 7561705 (Why is no real title available?) | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7559440 (Why is no real title available?) | 2022-07-18 | Paper |
On the expressive power of non-deterministic and unambiguous Petri nets over infinite words
Fundamenta Informaticae | 2022-02-01 | Paper |
Unambiguous languages exhaust the index hierarchy
(available as arXiv preprint) | 2021-07-28 | Paper |
The uniform measure of simple regular sets of infinite trees
Information and Computation | 2021-06-03 | Paper |
Uniformisations of regular relations over bi-infinite words
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
How deterministic are good-for-games automata?
(available as arXiv preprint) | 2020-11-25 | Paper |
| A Characterisation of Pi^0_2 Regular Tree Languages | 2020-05-26 | Paper |
Regular tree languages in low levels of the Wadge hierarchy
(available as arXiv preprint) | 2019-09-13 | Paper |
The logical strength of Büchi's decidability theorem
(available as arXiv preprint) | 2019-05-24 | Paper |
| Büchi VASS recognise \(\mathbf{\Sigma}^{1}_{1}\)-complete \({\omega}\)-languages | 2018-10-23 | Paper |
On the strength of unambiguous tree automata
International Journal of Foundations of Computer Science | 2018-09-20 | Paper |
Monadic Second Order Logic with Measure and Category Quantifiers
(available as arXiv preprint) | 2018-04-25 | Paper |
| On the complexity of branching games with regular conditions | 2018-03-21 | Paper |
| Deciding the topological complexity of Büchi languages | 2017-12-19 | Paper |
| Irregular behaviours for probabilistic automata | 2017-10-27 | Paper |
| Connecting decidability and complexity for MSO logic | 2017-10-13 | Paper |
Measure properties of regular sets of trees
Information and Computation | 2017-09-28 | Paper |
| The logical strength of Büchi's decidability theorem | 2017-07-19 | Paper |
Index problems for game automata
ACM Transactions on Computational Logic | 2017-07-13 | Paper |
Rabin-Mostowski index problem: a step beyond deterministic automata
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
| scientific article; zbMATH DE number 6680130 (Why is no real title available?) | 2017-02-02 | Paper |
| Regular languages of thin trees | 2017-01-30 | Paper |
Unambiguous Büchi Is Weak
Developments in Language Theory | 2016-08-30 | Paper |
The logical strength of B\"uchi's decidability theorem
(available as arXiv preprint) | 2016-08-26 | Paper |
Descriptive set theoretic methods in automata theory. Decidability and topological complexity
Lecture Notes in Computer Science | 2016-08-05 | Paper |
Regular languages of thin trees
Theory of Computing Systems | 2016-06-03 | Paper |
On Determinisation of Good-for-Games Automata
Automata, Languages, and Programming | 2015-11-04 | Paper |
Trading bounds for memory in games with counters
Automata, Languages, and Programming | 2015-11-04 | Paper |
On the weak index problem for game automata
Logic, Language, Information, and Computation | 2015-09-24 | Paper |
Measure Properties of Game Tree Languages
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
On the decidability of MSO+U on infinite trees
Automata, Languages, and Programming | 2014-07-01 | 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 |
Separation property for B- and S-regular languages
Logical Methods in Computer Science | 2014-03-24 | Paper |
Topological extension of parity automata
Information and Computation | 2013-12-19 | Paper |
Nondeterminism in the presence of a diverse or unknown future
Automata, Languages, and Programming | 2013-08-07 | Paper |
The topological complexity of MSO+U and related automata models
Fundamenta Informaticae | 2012-09-06 | Paper |
On the topological complexity of MSO+U and related automata models
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
On the Borel complexity of MSO definable sets of branches
Fundamenta Informaticae | 2010-05-25 | Paper |
