| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5091268 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089180 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5028484 | 2022-02-09 | Paper |
| Algebra for trees | 2022-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5856407 | 2021-03-26 | Paper |
| First-order tree-to-tree functions | 2021-01-21 | Paper |
| Extensions of ω-Regular Languages | 2021-01-21 | Paper |
| Regular and First-Order List Functions | 2021-01-20 | Paper |
| Definable decompositions for graphs of bounded linear cliquewidth | 2021-01-20 | Paper |
| On computability and tractability for infinite sets | 2021-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111332 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111438 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111446 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5216303 | 2020-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5216326 | 2020-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5207048 | 2020-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5232909 | 2019-09-13 | Paper |
| Decomposition theorems and model-checking for the modal μ -calculus | 2018-04-23 | Paper |
| Star Height via Games | 2018-04-23 | Paper |
| Definability equals recognizability for graphs of bounded treewidth | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636613 | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601873 | 2018-01-24 | Paper |
| It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton | 2018-01-19 | Paper |
| Thin MSO with a Probabilistic Path Quantifier. | 2017-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4596779 | 2017-12-11 | Paper |
| Turing Machines with Atoms | 2017-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957916 | 2017-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957477 | 2017-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957484 | 2017-01-26 | Paper |
| Rigidity is undecidable | 2016-07-26 | Paper |
| Regular languages of thin trees | 2016-06-03 | Paper |
| Two-variable logic on data trees and XML reasoning | 2015-11-11 | Paper |
| Recognisable Languages over Monads | 2015-11-10 | Paper |
| Containment of Monadic Datalog Programs via Bounded Clique-Width | 2015-11-04 | Paper |
| Two-variable logic on data words | 2015-09-17 | Paper |
| Towards nominal computation | 2015-09-11 | Paper |
| Automata theory in nominal sets | 2014-09-05 | Paper |
| Transducers with Origin Information | 2014-07-01 | Paper |
| Weak MSO+U with Path Quantifiers over Infinite Trees | 2014-07-01 | Paper |
| On the Decidability of MSO+U on Infinite Trees | 2014-07-01 | Paper |
| XPath evaluation in linear time | 2014-02-17 | Paper |
| Solutions in XML data exchange | 2014-01-20 | Paper |
| Nominal monoids | 2013-10-21 | Paper |
| Modelling Infinite Structures with Atoms | 2013-09-17 | Paper |
| Fraenkel-Mostowski Sets with Non-homogeneous Atoms | 2013-01-07 | Paper |
| Ramsey's theorem for colors from a metric space | 2012-11-08 | Paper |
| A Machine-Independent Characterization of Timed Languages | 2012-11-01 | Paper |
| Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets | 2012-11-01 | Paper |
| Toward Model Theory with Data Values | 2012-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2920114 | 2012-10-24 | Paper |
| Piecewise testable tree languages | 2012-10-22 | Paper |
| Wreath Products of Forest Algebras, with Applications to Tree Logics | 2012-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2904801 | 2012-08-23 | Paper |
| Finite satisfiability for guarded fixpoint logic | 2012-07-20 | Paper |
| Weak MSO with the Unbounding Quantifier | 2012-04-24 | Paper |
| An extension of data automata that captures XPath | 2012-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113676 | 2012-01-23 | Paper |
| Beyond $\omega$-Regular Languages | 2012-01-23 | Paper |
| Weak MSO with the unbounding quantifier | 2011-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3086921 | 2011-03-30 | Paper |
| Tree Languages Defined in First-Order Logic with One Quantifier Alternation | 2010-12-20 | Paper |
| Efficient Evaluation of Nondeterministic Automata Using Factorization Forests | 2010-09-07 | Paper |
| Tree-walking automata do not recognize all regular languages | 2010-08-16 | Paper |
| On the Borel Complexity of MSO Definable Sets of Branches | 2010-05-25 | Paper |
| A new algorithm for testing if a regular language is locally threshold testable | 2010-03-24 | Paper |
| Algebra for Infinite Forests with an Application to the Temporal Logic EF | 2009-10-22 | Paper |
| Two-Way Unary Temporal Logic over Trees | 2009-08-20 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| Factorization Forests | 2009-07-07 | Paper |
| Tree-Walking Automata Do Not Recognize All Regular Languages | 2009-04-30 | Paper |
| Expressive Power of Pebble Automata | 2009-03-12 | Paper |
| Forest Expressions | 2009-03-05 | Paper |
| Tree-Walking Automata | 2008-11-20 | Paper |
| Shuffle Expressions and Words with Nested Data | 2008-09-17 | Paper |
| Tree Languages Defined in First-Order Logic with One Quantifier Alternation | 2008-08-19 | Paper |
| The Common Fragment of ACTL and LTL | 2008-04-11 | Paper |
| Bounded Depth Data Trees | 2007-11-28 | Paper |
| Reachability in Unions of Commutative Rewriting Systems Is Decidable | 2007-09-03 | Paper |
| Characterizing EF and EX tree logics | 2006-09-13 | Paper |
| Tree-walking automata cannot be determinized | 2006-03-20 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| CONCUR 2004 - Concurrency Theory | 2005-08-23 | Paper |
| Computer Science Logic | 2005-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737212 | 2004-08-11 | Paper |
| The finite graph problem for two-way alternating automata. | 2003-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2769426 | 2002-02-05 | Paper |
