| Publication | Date of Publication | Type |
|---|
| A complexity approach to tree algebras: the polynomial case | 2024-08-06 | Paper |
| From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism | 2024-07-03 | Paper |
| On the size of good-for-games Rabin automata and its link with the memory in Muller games | 2024-06-24 | Paper |
| Playing Safe, Ten Years Later | 2024-03-11 | Paper |
| Cost Automata, Safe Schemes, and Downward Closures | 2023-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874305 | 2023-02-07 | Paper |
| The Theory of Universal Graphs for Infinite Duration Games | 2022-10-06 | Paper |
| On Reachability Problems for Low-Dimensional Matrix Semigroups | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5028432 | 2022-02-09 | Paper |
| The factorisation forest theorem | 2022-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144609 | 2021-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144652 | 2021-01-19 | Paper |
| Controlling a random population | 2020-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111267 | 2020-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5109522 | 2020-05-12 | Paper |
| Universal graphs and good for games automata: new tools for infinite duration games | 2020-01-28 | Paper |
| AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS | 2018-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580203 | 2018-08-13 | Paper |
| Two-way cost automata and cost logics over infinite trees | 2018-04-23 | Paper |
| The Complexity of Boundedness for Guarded Logics | 2018-04-23 | Paper |
| Games with bound guess actions | 2018-04-23 | Paper |
| On a Fragment of AMSO and Tiling Systems | 2018-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601881 | 2018-01-24 | Paper |
| The Bridge Between Regular Cost Functions and Omega-Regular Languages | 2017-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4596779 | 2017-12-11 | Paper |
| Automata and program analysis | 2017-11-22 | Paper |
| Fragments of Fixpoint Logic on Data Words | 2017-07-13 | Paper |
| Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory | 2017-07-03 | Paper |
| Generalized Data Automata and Fixpoint Logic | 2017-04-25 | Paper |
| Playing Safe | 2017-04-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2958524 | 2017-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957917 | 2017-01-30 | Paper |
| Combinatorial Expressions and Lower Bounds. | 2017-01-24 | Paper |
| Approximate comparison of functions computed by distance automata | 2016-06-03 | Paper |
| Limited Set quantifiers over Countable Linear Orderings | 2015-11-04 | Paper |
| Logics with rigidly guarded data tests | 2015-10-29 | Paper |
| Unambiguity in Automata Theory | 2015-08-07 | Paper |
| Enforcing trace properties by program transformation | 2015-03-17 | Paper |
| Asymptotic Monadic Second-Order Logic | 2014-10-14 | Paper |
| Size-Change Abstraction and Max-Plus Automata | 2014-10-14 | Paper |
| Regular Cost Functions, Part I: Logic and Algebra over Words | 2013-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2842873 | 2013-08-16 | Paper |
| Composition with Algebra at the Background | 2013-06-14 | Paper |
| Forms of Determinism for Automata (Invited Talk) | 2012-08-23 | Paper |
| On the Use of Guards for Logics with Data | 2011-08-17 | Paper |
| Regular Languages of Words over Countable Linear Orderings | 2011-07-07 | Paper |
| Green’s Relations and Their Use in Automata Theory | 2011-06-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3086920 | 2011-03-30 | Paper |
| Regular Temporal Cost Functions | 2010-09-07 | Paper |
| Tree-walking automata do not recognize all regular languages | 2010-08-16 | Paper |
| Factorization forests for infinite words and applications to countable scattered linear orderings | 2010-02-09 | Paper |
| The Theory of Stabilisation Monoids and Regular Cost Functions | 2009-07-14 | Paper |
| A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata | 2009-07-14 | Paper |
| Tree-Walking Automata Do Not Recognize All Regular Languages | 2009-04-30 | Paper |
| The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem | 2008-11-20 | Paper |
| The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata | 2008-08-19 | Paper |
| Factorisation Forests for Infinite Words | 2008-02-26 | Paper |
| A Combinatorial Theorem for Trees | 2007-11-28 | Paper |
| Transforming structures by set interpretations | 2007-10-11 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| On the positional determinacy of edge-labeled games | 2006-03-24 | Paper |
| Tree-walking automata cannot be determinized | 2006-03-20 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737148 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449206 | 2004-02-08 | Paper |
