| Publication | Date of Publication | Type |
|---|
| On the Boolean Closure of Deterministic Top-Down Tree Automata | 2024-02-16 | Paper |
| On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words | 2023-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6168432 | 2023-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874214 | 2023-02-07 | Paper |
| A First-Order Logic with Frames | 2022-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092321 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092425 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090498 | 2022-07-18 | Paper |
| Automata on finite trees | 2022-02-04 | Paper |
| Automata on infinite trees | 2022-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4995361 | 2021-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4994935 | 2021-06-22 | Paper |
| Projection for Büchi Tree Automata with Constraints between Siblings | 2021-04-19 | Paper |
| Ambiguity, weakness, and regularity in probabilistic Büchi automata | 2020-09-23 | Paper |
| New Optimizations and Heuristics for Determinization of Büchi Automata | 2020-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5377226 | 2019-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4645660 | 2019-01-10 | Paper |
| Projection for Büchi tree automata with constraints between siblings | 2018-11-22 | Paper |
| On finitely ambiguous Büchi automata | 2018-11-22 | Paper |
| Pure Strategies in Imperfect Information Stochastic Games | 2018-10-26 | Paper |
| Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings | 2018-04-23 | Paper |
| Uniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608652 | 2018-03-21 | Paper |
| On equivalence and uniformisation problems for finite transducers | 2017-12-19 | Paper |
| Decision problems for subclasses of rational relations over finite and infinite words | 2017-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5351973 | 2017-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5271416 | 2017-07-11 | Paper |
| Synthesis of deterministic top-down tree transducers from automatic tree relations | 2017-03-16 | Paper |
| Decidability Results on the Existence of Lookahead Delegators for NFA | 2017-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2958524 | 2017-02-02 | Paper |
| Simplification Problems for Deterministic Pushdown Automata on Infinite Words | 2016-04-15 | Paper |
| Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists | 2015-10-20 | Paper |
| Definability and Transformations for Cost Logics and Automatic Structures | 2014-10-14 | Paper |
| Modeling and Verification of Infinite Systems with Resources | 2014-01-08 | Paper |
| Basics on Tree Automata | 2013-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2920139 | 2012-10-24 | Paper |
| Regularity Problems for Weak Pushdown ω-Automata and Games | 2012-09-25 | Paper |
| Degrees of Lookahead in Context-free Infinite Games | 2012-09-18 | Paper |
| Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata | 2012-07-25 | Paper |
| Improved Ramsey-Based Büchi Complementation | 2012-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3172528 | 2011-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3086920 | 2011-03-30 | Paper |
| Choice functions and well-orderings over the infinite binary tree | 2010-11-22 | Paper |
| Obliging Games | 2010-08-31 | Paper |
| Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata | 2010-05-26 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| MSO on the Infinite Binary Tree: Choice and Order | 2009-03-05 | Paper |
| A characterization of first-order topological properties of planar spatial data | 2008-12-21 | Paper |
| The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem | 2008-11-20 | Paper |
| Transition Graphs of Rewriting Systems over Unranked Trees | 2008-09-17 | Paper |
| The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata | 2008-08-19 | Paper |
| Memory Reduction for Strategies in Infinite Games | 2008-06-10 | Paper |
| Regularity Problems for Visibly Pushdown Languages | 2008-03-19 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Unranked Tree Automata with Sibling Equalities and Disequalities | 2007-11-28 | Paper |
| Transforming structures by set interpretations | 2007-10-11 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Propositional dynamic logic with recursive programs | 2007-08-23 | Paper |
| Foundations of Software Science and Computation Structures | 2007-05-02 | Paper |
| Reachability problems on regular ground tree rewriting graphs | 2006-10-25 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science | 2005-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4824478 | 2004-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736871 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738232 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536446 | 2002-11-25 | Paper |
| Efficient minimization of deterministic weak \(\omega\)-automata | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501665 | 2000-11-07 | Paper |
