| Publication | Date of Publication | Type |
|---|
| On Presburger arithmetic extended with non-unary counting quantifiers | 2023-08-26 | Paper |
| Alternating complexity of counting first-order logic for the subword order | 2023-03-01 | Paper |
| The Subtrace Order and Counting First-Order Logic | 2022-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089232 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5079723 | 2022-05-28 | Paper |
| Traces, Series-Parallel Posets, and Pictures: A Weighted Study | 2022-04-28 | Paper |
| Second-order finite automata: expressive power and simple proofs using automatic structures | 2022-03-25 | Paper |
| Weighted automata | 2022-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5015280 | 2021-12-07 | Paper |
| Communicating automata | 2021-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002820 | 2021-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144680 | 2021-01-19 | Paper |
| Languages ordered by the subword order | 2020-01-28 | Paper |
| The inclusion structure of partially lossy queue monoids and their trace submonoids | 2018-11-01 | Paper |
| Multi-buffer simulations: decidability and complexity | 2018-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4585066 | 2018-09-06 | Paper |
| Hanf normal form for first-order logic with unary counting quantifiers | 2018-04-23 | Paper |
| The monoid of queue actions | 2018-02-28 | Paper |
| Dependence orders for computations of concurrent automata | 2017-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5351975 | 2017-08-31 | Paper |
| The transformation monoid of a partially lossy queue | 2017-08-22 | Paper |
| The complexity of model checking multi-stack systems | 2017-08-15 | Paper |
| On Boolean closed full trios and rational Kripke frames | 2017-07-17 | Paper |
| An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree | 2017-07-03 | Paper |
| The Complexity of Model Checking Multi-stack Systems | 2017-07-03 | Paper |
| The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids | 2016-08-30 | Paper |
| On Presburger Arithmetic Extended with Modulo Counting Quantifiers | 2015-10-01 | Paper |
| Almost Every Domain is Universal | 2015-07-10 | Paper |
| RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA | 2015-04-29 | Paper |
| The Monoid of Queue Actions | 2014-10-14 | Paper |
| Isomorphisms of scattered automatic linear orders | 2014-04-16 | Paper |
| Logical Aspects of the Lexicographic Order on 1-Counter Languages | 2013-09-20 | Paper |
| The isomorphism problem on classes of automatic structures with transitive relations | 2013-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4910742 | 2013-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4649565 | 2012-11-22 | Paper |
| The isomorphism problem for \(\omega \)-automatic trees | 2012-11-20 | Paper |
| An optimal construction of Hanf sentences | 2012-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3118391 | 2012-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113778 | 2012-01-23 | Paper |
| Automatic structures of bounded degree revisited | 2011-12-23 | Paper |
| Where Automatic Structures Benefit from Weighted Automata | 2011-11-11 | Paper |
| Construction of tree automata from regular expressions | 2011-10-28 | Paper |
| Size and Computation of Injective Tree Automatic Presentations | 2011-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3077192 | 2011-02-22 | Paper |
| Propositional Dynamic Logic for Message-Passing Systems | 2010-09-21 | Paper |
| The Isomorphism Problem for ω-Automatic Trees | 2010-09-03 | Paper |
| Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces | 2010-08-18 | Paper |
| Some natural decision problems in automatic graphs | 2010-06-24 | Paper |
| Branching Automata with Costs — A Way of Reflecting Parallelism in Costs | 2010-05-07 | Paper |
| CONCUR 2003 - Concurrency Theory | 2010-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3408148 | 2010-02-24 | Paper |
| Automatic Structures of Bounded Degree Revisited | 2009-11-12 | Paper |
| Theories of Automatic Structures and Their Complexity | 2009-11-05 | Paper |
| Weighted asynchronous cellular automata | 2009-06-22 | Paper |
| Construction of Tree Automata from Regular Expressions | 2008-10-30 | Paper |
| Muller message-passing automata and logics | 2008-10-08 | Paper |
| Schützenberger's theorem on formal power series follows from Kleene's theorem | 2008-07-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3504343 | 2008-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3504344 | 2008-06-11 | Paper |
| First-order and counting theories ofω-automatic structures | 2008-05-08 | Paper |
| Propositional Dynamic Logic for Message-Passing Systems | 2008-04-24 | Paper |
| Weighted Asynchronous Cellular Automata | 2008-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5431917 | 2008-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5431918 | 2008-01-02 | Paper |
| Foundations of Software Science and Computation Structures | 2007-05-02 | Paper |
| Skew and infinitary formal power series | 2007-01-09 | Paper |
| CONCUR 2005 – Concurrency Theory | 2006-11-01 | Paper |
| On graph products of automatic and biautomatic monoids. | 2006-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5485973 | 2006-09-06 | Paper |
| LOGICAL ASPECTS OF CAYLEY-GRAPHS: THE MONOID CASE | 2006-08-14 | Paper |
| A Kleene theorem and model checking algorithms for existentially bounded communicating automata | 2006-07-12 | Paper |
| Theories of orders on the set of words | 2006-02-22 | Paper |
| Developments in Language Theory | 2005-12-22 | Paper |
| Developments in Language Theory | 2005-12-22 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2005-11-10 | Paper |
| Distributive lattices with a decidable monadic second order theory. | 2005-04-19 | Paper |
| Decidable first-order theories of one-step rewriting in trace monoids | 2005-02-24 | Paper |
| Logical aspects of Cayley-graphs: the group case | 2005-01-31 | Paper |
| Branching automata with costs -- a way of reflecting parallelism in costs | 2005-01-11 | Paper |
| Regular sets of infinite message sequence charts | 2004-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736865 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737205 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737908 | 2004-08-11 | Paper |
| The topology of Mazurkiewicz traces. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449193 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418673 | 2003-08-11 | Paper |
| On random relational structures | 2003-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4807831 | 2003-05-26 | Paper |
| Towards a language theory for infinite N-free pomsets. | 2003-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782712 | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536618 | 2002-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536626 | 2002-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2767036 | 2002-07-22 | Paper |
| Recognizable languages in divisibility monoids | 2002-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762523 | 2002-01-09 | Paper |
| Complementary closed relational clones are not always Krasner clones | 2001-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754184 | 2001-11-11 | Paper |
| Generic automorphisms of the universal partial order | 2001-05-14 | Paper |
| On Existentially First-Order Definable Languages and Their Relation to NP | 2000-12-06 | Paper |
| Asynchronous cellular automata for pomsets | 2000-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251923 | 2000-10-17 | Paper |
| On homogeneous semilattices and their automorphism groups | 2000-10-08 | Paper |
| Symmetries of the partial order of traces | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4954451 | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934333 | 2000-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4231780 | 1999-03-15 | Paper |
| Representation of computations in concurrent automata by dependence orders | 1998-10-22 | Paper |
| Topology for Computations of Concurrent Automata | 1997-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4867292 | 1996-02-28 | Paper |
