| Publication | Date of Publication | Type |
|---|
| Elements of Discrete Mathematics | 2023-11-07 | Paper |
| Reachability games and parity games | 2023-07-28 | Paper |
| Removing ε-transitions in timed automata | 2022-11-09 | Paper |
| Properties of graphs specified by a regular language | 2022-08-30 | Paper |
| Word problems over traces which are solvable in linear time | 2022-08-16 | Paper |
| Properties of graphs specified by a regular language | 2022-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5028483 | 2022-02-09 | Paper |
| Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices | 2021-01-22 | Paper |
| Solutions to twisted word equations and equations in virtually free groups | 2020-07-24 | Paper |
| Context-Free Groups and Bass–Serre Theory | 2020-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111428 | 2020-05-27 | Paper |
| A domain for concurrent termination a generalization of Mazurkiewicz traces | 2019-01-10 | Paper |
| Regular Languages Are Church-Rosser Congruential | 2018-08-02 | Paper |
| Solving trace equations using lexicographical normal forms | 2018-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598269 | 2017-12-19 | Paper |
| Characterizing Classes of Regular Languages Using Prefix Codes of Bounded Synchronization Delay | 2017-12-19 | Paper |
| On codings of traces | 2017-12-04 | Paper |
| Trace rewriting: Computing normal forms in time O(n log n) | 2017-11-16 | Paper |
| Church-Rosser systems, codes with bounded synchronization delay and local Rees extensions | 2017-11-15 | Paper |
| Characterizing classes of regular languages using prefix codes of bounded synchronization delay | 2017-11-03 | Paper |
| Equations over free inverse monoids with idempotent variables | 2017-10-20 | Paper |
| Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem | 2017-06-01 | Paper |
| QuickHeapsort: modifications and improved analysis | 2017-01-18 | Paper |
| Conjugacy in Baumslag's group, generic case complexity, and division in power circuits | 2016-12-21 | Paper |
| Finding all solutions of equations in free groups and monoids with involution | 2016-11-18 | Paper |
| Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem | 2016-09-29 | Paper |
| Solution sets for equations over free groups are EDT0L languages | 2016-09-23 | Paper |
| Asymptotic Approximation for the Quotient Complexities of Atoms | 2016-05-03 | Paper |
| Discrete algebraic methods. Arithmetic, cryptography, automata and groups | 2016-04-05 | Paper |
| A Note on Monitors and Büchi Automata | 2016-02-25 | Paper |
| Logspace computations in graph products | 2016-02-11 | Paper |
| A survey on the local divisor technique | 2015-12-10 | Paper |
| Logspace computations in graph products | 2015-11-11 | Paper |
| Solution Sets for Equations over Free Groups are EDT0L Languages | 2015-11-04 | Paper |
| Equations over free inverse monoids with idempotent variables | 2015-10-20 | Paper |
| More Than 1700 Years of Word Equations | 2015-09-22 | Paper |
| Omega-rational expressions with bounded synchronization delay | 2015-07-20 | Paper |
| SLP compression for solutions of equations with constraints in free and hyperbolic groups | 2015-04-21 | Paper |
| Solution sets for equations over free groups are EDT0L languages -- ICALP 2015 version | 2015-02-11 | Paper |
| Finding All Solutions of Equations in Free Groups and Monoids with Involution | 2014-06-24 | Paper |
| Topology, monitorable properties and runtime verification | 2014-06-10 | Paper |
| Conjugacy in Baumslag's group, generic case complexity, and division in power circuits | 2014-03-31 | Paper |
| Cyclic rewriting and conjugacy problems | 2014-01-30 | Paper |
| Logspace Computations in Coxeter Groups and Graph Groups | 2014-01-03 | Paper |
| Elemente der diskreten Mathematik | 2013-07-23 | Paper |
| Diskrete algebraische Methoden | 2013-07-23 | Paper |
| QuickHeapsort: modifications and improved analysis | 2013-06-14 | Paper |
| CONTEXT-FREE GROUPS AND THEIR STRUCTURE TREES | 2013-06-05 | Paper |
| EFFICIENT ALGORITHMS FOR HIGHLY COMPRESSED DATA: THE WORD PROBLEM IN HIGMAN'S GROUP IS IN P | 2013-01-30 | Paper |
| GROUP EXTENSIONS OVER INFINITE WORDS | 2013-01-18 | Paper |
| Regular Languages Are Church-Rosser Congruential | 2012-11-01 | Paper |
| Deciding regularity of hairpin completions of regular languages in polynomial time | 2012-10-11 | Paper |
| Star-free languages are Church-Rosser congruential | 2012-10-11 | Paper |
| On Distributed Monitoring of Asynchronous Systems | 2012-09-21 | Paper |
| Bounded Synchronization Delay in Omega-Rational Expressions | 2012-09-10 | Paper |
| Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P | 2012-08-23 | Paper |
| Logspace Computations in Graph Groups and Coxeter Groups | 2012-06-29 | Paper |
| The Krohn-Rhodes Theorem and Local Divisors | 2012-06-20 | Paper |
| Language theoretical properties of hairpin formations | 2012-05-30 | Paper |
| Fragments of First-Order Logic over Infinite Words. | 2012-04-24 | Paper |
| IT IS NL-COMPLETE TO DECIDE WHETHER A HAIRPIN COMPLETION OF REGULAR LANGUAGES IS REGULAR | 2012-03-13 | Paper |
| Solving Word Problems in Group Extensions over Infinite Words | 2011-07-29 | Paper |
| Fragments of first-order logic over infinite words | 2011-05-23 | Paper |
| Local Temporal Logic Is Expressively Complete for Cograph Dependence Alphabets | 2011-05-06 | Paper |
| ON COMPUTING GEODESICS IN BAUMSLAG–SOLITAR GROUPS | 2011-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3086925 | 2011-03-30 | Paper |
| Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract) | 2011-02-11 | Paper |
| Geodesic rewriting systems and pregroups | 2010-09-14 | Paper |
| Weinbaum factorizations of primitive words | 2010-02-05 | Paper |
| On the Hairpin Completion of Regular Languages | 2009-08-20 | Paper |
| Some remarks about stabilizers | 2009-08-07 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5190776 | 2009-07-27 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Partially commutative inverse monoids. | 2008-12-02 | Paper |
| A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS | 2008-11-24 | Paper |
| WORD EQUATIONS OVER GRAPH PRODUCTS | 2008-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3504335 | 2008-06-11 | Paper |
| ALGORITHMIC PROBLEMS ON INVERSE MONOIDS OVER VIRTUALLY FREE GROUPS | 2008-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5431910 | 2008-01-02 | Paper |
| On First-Order Fragments for Words and Mazurkiewicz Traces | 2007-11-28 | Paper |
| Partially Commutative Inverse Monoids | 2007-09-05 | Paper |
| SOLVABILITY OF EQUATIONS IN GRAPH GROUPS IS DECIDABLE | 2007-03-21 | Paper |
| Pure future local temporal logics are expressively complete for Mazurkiewicz traces | 2007-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5485974 | 2006-09-06 | Paper |
| From local to global temporal logics over Mazurkiewicz traces. | 2006-05-18 | Paper |
| The existential theory of equations with rational constraints in free groups is PSPACE-complete | 2005-11-22 | Paper |
| Local temporal logic is expressively complete for cograph dependence alphabets | 2005-02-22 | Paper |
| Regular frequency computations | 2005-02-22 | Paper |
| Existential and positive theories of equations in graph products | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736866 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738286 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4412099 | 2003-07-13 | Paper |
| A structural property of regular frequency computations. | 2003-01-22 | Paper |
| A NOTE ON THE EXISTENTIAL THEORY OF EQUATIONS IN PLAIN GROUPS | 2002-12-15 | Paper |
| LTL is expressively complete for Mazurkiewicz traces | 2002-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535046 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762503 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754145 | 2001-11-11 | Paper |
| Combinatorial rewriting on traces | 2001-11-08 | Paper |
| Transitive orientations, Möbius functions, and complete semi-Thue systems for free partially commutative monoids | 2001-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2742600 | 2001-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945225 | 2000-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941171 | 2000-02-29 | Paper |
| Solving word equations modulo partial commutations | 2000-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4264103 | 1999-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251053 | 1999-06-17 | Paper |
| Approximating traces | 1999-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4421582 | 1999-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4380157 | 1998-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375801 | 1998-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4371025 | 1998-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4348006 | 1997-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347957 | 1997-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4874653 | 1996-08-13 | Paper |
| Rational and recognizable complex trace languages | 1995-04-10 | Paper |
| A partial trace semantics for Petri nets | 1995-01-09 | Paper |
| Deterministic asynchronous automata for infinite traces | 1994-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4284225 | 1994-08-31 | Paper |
| On confluent semi-commutations: Decidability and complexity results | 1994-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281564 | 1994-03-10 | Paper |
| Möbius functions and confluent semi-commutations | 1993-12-20 | Paper |
| On the concatenation of infinite traces | 1993-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035234 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035661 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036566 | 1993-05-18 | Paper |
| Combinatorics on traces | 1993-01-23 | Paper |
| On ``inherently context-sensitive languages -- an application of complexity cores | 1992-06-28 | Paper |
| Word problems over traces which are solvable in linear time | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3355239 | 1990-01-01 | Paper |
| On the synchronization of traces | 1989-01-01 | Paper |
| On the Knuth-Bendix completion for concurrent processes | 1989-01-01 | Paper |
| Hotz-isomorphism theorems in formal language theory | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3489462 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787508 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798213 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3771597 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3775715 | 1987-01-01 | Paper |
| Eine Bemerkung zu freien Moduln über regulären lokalen Ringen. (Remark on free modules over regular local rings) | 1986-01-01 | Paper |
| Commutative monoids have complete presentations by free (non-commutative) monoids | 1986-01-01 | Paper |
| Complete semi-Thue systems for abelian groups | 1986-01-01 | Paper |
| Investigations on Hotz groups for arbitrary grammars | 1986-01-01 | Paper |
| On some variants of the Ehrenfeucht conjecture | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3700852 | 1985-01-01 | Paper |
| Über die absolute Galoisgruppe dyadischer Zahlkörper. | 1984-01-01 | Paper |
| Demuškin-Erzeugende und Einbettungsprobleme für elementar-abelsche 2-Erweiterungen zwei-adischer Zahlkörper | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3320489 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3944692 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3890797 | 1981-01-01 | Paper |
