| Publication | Date of Publication | Type |
|---|
| 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 |
| https://portal.mardi4nfdi.de/entity/Q5092424 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089242 | 2022-07-18 | Paper |
| On the expressive power of non-deterministic and unambiguous Petri nets over infinite words | 2022-02-01 | Paper |
| Unambiguous languages exhaust the index hierarchy | 2021-07-28 | Paper |
| The uniform measure of simple regular sets of infinite trees | 2021-06-03 | Paper |
| Uniformisations of regular relations over bi-infinite words | 2021-01-21 | Paper |
| How deterministic are good-for-games automata? | 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 | 2019-09-13 | Paper |
| The logical strength of Büchi's decidability theorem | 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 | 2018-09-20 | Paper |
| Monadic Second Order Logic with Measure and Category Quantifiers | 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 | 2017-09-28 | Paper |
| The logical strength of Büchi's decidability theorem | 2017-07-19 | Paper |
| Index problems for game automata | 2017-07-13 | Paper |
| Rabin-Mostowski index problem: a step beyond deterministic automata | 2017-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2958515 | 2017-02-02 | Paper |
| Regular languages of thin trees | 2017-01-30 | Paper |
| Unambiguous Büchi Is Weak | 2016-08-30 | Paper |
| The logical strength of B\"uchi's decidability theorem | 2016-08-26 | Paper |
| Descriptive set theoretic methods in automata theory. Decidability and topological complexity | 2016-08-05 | Paper |
| Regular languages of thin trees | 2016-06-03 | Paper |
| On Determinisation of Good-for-Games Automata | 2015-11-04 | Paper |
| Trading bounds for memory in games with counters | 2015-11-04 | Paper |
| On the weak index problem for game automata | 2015-09-24 | Paper |
| Measure Properties of Game Tree Languages | 2014-10-14 | Paper |
| On the decidability of MSO+U on infinite trees | 2014-07-01 | Paper |
| On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets | 2014-04-15 | Paper |
| Separation property for \(\omega\)B- and \(\omega\)S-regular languages | 2014-03-24 | Paper |
| Topological extension of parity automata | 2013-12-19 | Paper |
| Nondeterminism in the presence of a diverse or unknown future | 2013-08-07 | Paper |
| The topological complexity of MSO+U and related automata models | 2012-09-06 | Paper |
| On the topological complexity of MSO+U and related automata models | 2010-09-03 | Paper |
| On the Borel complexity of MSO definable sets of branches | 2010-05-25 | Paper |
