| Publication | Date of Publication | Type |
|---|
| Succinct determinisation of counting automata via sphere construction | 2024-04-19 | Paper |
| Incremental dead state detection in logarithmic time | 2024-01-12 | Paper |
| Simulation algorithms for symbolic automata | 2023-07-28 | Paper |
| Minimization of symbolic transducers | 2022-08-12 | Paper |
| The power of symbolic automata and transducers | 2022-07-01 | Paper |
| Theoretical aspects of symbolic automata | 2020-10-21 | Paper |
| Forward bisimulations for nondeterministic symbolic finite automata | 2020-08-05 | Paper |
| Monadic decomposition | 2018-05-17 | Paper |
| Minimization of symbolic tree automata | 2018-04-23 | Paper |
| Monadic second-order logic on finite sequences | 2017-10-20 | Paper |
| Equivalence of finite-valued symbolic finite transducers | 2016-12-21 | Paper |
| Data-parallel string-manipulating programs | 2016-09-29 | Paper |
| Program boosting: program synthesis via crowd-sourcing | 2016-09-29 | Paper |
| Construction of natural cycletrees | 2016-05-26 | Paper |
| Symbolic tree transducers | 2015-12-07 | Paper |
| Symbolic string transformations with regular lookahead and rollback | 2015-12-03 | Paper |
| Extended symbolic finite automata and transducers | 2015-10-20 | Paper |
| Symbolic finite state transducers: algorithms and applications | 2015-09-11 | Paper |
| RIGID REACHABILITY, THE NON-SYMMETRIC FORM OF RIGID E-UNIFICATION | 2015-04-29 | Paper |
| Symbolic tree automata | 2014-12-15 | Paper |
| Static analysis of string encoders and decoders | 2014-11-03 | Paper |
| Skolemization modulo theories | 2014-09-08 | Paper |
| Minimization of symbolic automata | 2014-04-10 | Paper |
| Applications of symbolic finite automata | 2013-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4904149 | 2013-01-28 | Paper |
| Symbolic automata: the toolkit | 2012-06-29 | Paper |
| An Evaluation of Automata Algorithms for String Analysis | 2011-02-15 | Paper |
| Qex: symbolic SQL query explorer | 2011-01-07 | Paper |
| Composing model programs for analysis | 2010-10-22 | Paper |
| Symbolic automata constraint solving | 2010-10-12 | Paper |
| Symbolic bounded conformance checking of model programs | 2010-02-02 | Paper |
| Input-Output Model Programs | 2009-08-20 | Paper |
| On Bounded Reachability of Programs with Set Comprehensions | 2009-01-27 | Paper |
| Can abstract state machines be useful in language theory? | 2007-05-11 | Paper |
| Play to Test | 2007-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415242 | 2003-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413699 | 2003-07-21 | Paper |
| On the undecidability of second-order unification | 2003-01-14 | Paper |
| Logic with equality: Partisan corroboration and shifted pairing | 2003-01-14 | Paper |
| Farmer's theorem revisited | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753719 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938629 | 2000-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4936123 | 2000-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249176 | 2000-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3838767 | 1998-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364523 | 1998-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375199 | 1998-01-28 | Paper |
