| Publication | Date of Publication | Type |
|---|
| Separation and covering for group based concatenation hierarchies | 2024-12-19 | Paper |
| A generic polynomial time approach to separation by first-order logic without quantifier alternation | 2024-09-12 | Paper |
| All about unambiguous polynomial closure | 2024-07-03 | Paper |
| How many times do you need to go back to the future in unary temporal logic? | 2023-07-26 | Paper |
| Characterizing level one in group-based concatenation hierarchies | 2022-11-11 | Paper |
| Recognizing pro-\(\mathrm{R}\) closures of regular languages | 2022-09-12 | Paper |
| The Complexity of Separation for Levels in Concatenation Hierarchies | 2022-07-21 | Paper |
| On All Things Star-Free | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5155687 | 2021-10-08 | Paper |
| Separating Without Any Ambiguity. | 2021-07-28 | Paper |
| Separation for dot-depth two | 2021-01-19 | Paper |
| Adding Successor | 2019-11-22 | Paper |
| Going Higher in First-Order Quantifier Alternation Hierarchies on Words | 2019-11-21 | Paper |
| The linear nature of pseudowords | 2019-08-15 | Paper |
| Generic results for concatenation hierarchies | 2019-07-04 | Paper |
| Recognizing pro-R closures of regular languages | 2019-05-24 | Paper |
| A characterization for decidable separability by piecewise testable languages | 2018-12-10 | Paper |
| The covering problem | 2018-08-15 | Paper |
| Separating regular languages with first-order logic | 2018-04-23 | Paper |
| Logical characterization of weighted pebble walking automata | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608640 | 2018-03-21 | Paper |
| Concatenation hierarchies: new bottle, old wine | 2017-08-22 | Paper |
| Reducibility of pointlike problems | 2017-07-14 | Paper |
| Factoriality and the Pin-Reutenauer procedure | 2017-03-03 | Paper |
| The linear nature of pseudowords | 2017-02-26 | Paper |
| Separating regular languages by locally testable and locally threshold testable languages | 2017-02-21 | Paper |
| Separation and the successor relation | 2017-01-24 | Paper |
| Quantifier alternation for infinite words | 2016-06-10 | Paper |
| Separating regular languages with first-order logic | 2016-03-11 | Paper |
| A Note on Decidable Separability by Piecewise Testable Languages | 2015-09-29 | Paper |
| McCammond’s normal forms for free aperiodic semigroups revisited | 2015-01-27 | Paper |
| Temporal logics for concurrent recursive programs: satisfiability and model checking | 2014-11-20 | Paper |
| Closures of regular languages for profinite topologies. | 2014-11-03 | Paper |
| On separation by locally testable and locally threshold testable languages | 2014-09-30 | Paper |
| Pebble weighted automata and weighted logics | 2014-07-17 | Paper |
| Going Higher in the First-Order Quantifier Alternation Hierarchy on Words | 2014-07-01 | Paper |
| Iterated periodicity over finite aperiodic semigroups | 2014-02-07 | Paper |
| Separating regular languages by piecewise testable and unambiguous languages | 2013-09-20 | Paper |
| Scenarios and covert channels: another game\dots | 2013-09-20 | Paper |
| A probabilistic Kleene theorem | 2012-11-21 | Paper |
| Place-boundedness for vector addition systems with one zero-test | 2012-08-29 | Paper |
| Model checking vector addition systems with one zero-test | 2012-07-03 | Paper |
| Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking | 2011-08-17 | Paper |
| Pebble weighted automata and transitive closure logics | 2010-09-07 | Paper |
| Description and analysis of a bottom-up DFA minimization algorithm | 2010-04-19 | Paper |
| THE EQUATIONAL THEORY OF ω-TERMS FOR FINITE ${\mathcal R}$-TRIVIAL SEMIGROUPS | 2010-04-14 | Paper |
| Distributed synthesis for well-connected architectures | 2009-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5190785 | 2009-07-27 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Tree Pattern Rewriting Systems | 2008-11-20 | Paper |
| Distributed Synthesis for Well-Connected Architectures | 2008-04-17 | Paper |
| Accelerating Interpolation-Based Model-Checking | 2008-04-11 | Paper |
| Complete reducibility of systems of equations with respect to \(\mathbf R\). | 2008-04-03 | Paper |
| Pointlike sets with respect to R and J. | 2007-12-06 | Paper |
| Complete reducibility of pseudovarieties. | 2007-12-05 | Paper |
| Model Checking Software | 2007-09-28 | Paper |
| An automata-theoretic approach to the word problem for \(\omega\)-terms over R | 2007-02-26 | Paper |
| Infinite-state high-level MSCs: model-checking and realizability | 2006-06-30 | Paper |
| Tameness of pseudovariety joins involving R. | 2006-02-07 | Paper |
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science | 2005-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737197 | 2004-08-11 | Paper |
| Tameness of Some Locally Trivial Pseudovarieties | 2003-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2743234 | 2001-09-27 | Paper |
| PSEUDOVARIETY JOINS INVOLVING ${\mathscr J}$ -TRIVIAL SEMIGROUPS | 2000-11-07 | Paper |
| The pseudovariety $J$ is hyperdecidable | 1999-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4227139 | 1999-02-23 | Paper |
| Three examples of join computations | 1999-01-27 | Paper |
| On embedding of finitely generated profinite semigroups into \(2\)-generated profinite semigroups | 1998-11-23 | Paper |
| The join of the pseudovarieties of idempotent semigroups and locally trivial semigroups | 1996-07-01 | Paper |
| Corrigendum: ``The join of the pseudovarieties of idempotent semigroups and locally trivial semigroups | 1996-04-23 | Paper |
| ON THE DECIDABILITY OF THE MEMBERSHIP PROBLEM OF THE PSEUDOVARIETY J∨B | 1996-02-22 | Paper |
