| Publication | Date of Publication | Type |
|---|
| On Billaud words and their companions | 2023-04-20 | Paper |
| Unambiguous injective morphisms in free groups | 2022-12-08 | Paper |
| A toolkit for Parikh matrices | 2022-08-16 | Paper |
| The Billaud conjecture for \(|\varSigma| = 4\), and beyond | 2022-08-11 | Paper |
| On Billaud words and their companions | 2022-05-20 | Paper |
| Reducing the ambiguity of Parikh matrices | 2021-03-09 | Paper |
| Reducing the ambiguity of Parikh matrices | 2020-07-27 | Paper |
| On the Prefix–Suffix Duplication Reduction | 2020-02-21 | Paper |
| Unique decipherability in formal languages | 2019-12-27 | Paper |
| Closure properties of pattern languages | 2016-11-14 | Paper |
| Unambiguous 1-uniform morphisms | 2016-03-01 | Paper |
| Factorization in Formal Languages | 2015-11-10 | Paper |
| Ambiguity of Morphisms in a Free Group | 2015-11-04 | Paper |
| Periodicity forcing words | 2015-09-16 | Paper |
| ON THE DUAL POST CORRESPONDENCE PROBLEM | 2015-04-23 | Paper |
| Patterns with bounded treewidth | 2014-11-28 | Paper |
| Closure Properties of Pattern Languages | 2014-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5416362 | 2014-05-20 | Paper |
| Regular and context-free pattern languages over small alphabets | 2014-01-13 | Paper |
| Finding shuffle words that represent optimal scheduling of shared memory access | 2013-10-22 | Paper |
| Periodicity Forcing Words | 2013-09-20 | Paper |
| Inferring descriptive generalisations of formal languages | 2013-07-24 | Paper |
| On the Dual Post Correspondence Problem | 2013-06-28 | Paper |
| Unambiguous 1-uniform morphisms | 2013-06-06 | Paper |
| Regular and Context-Free Pattern Languages over Small Alphabets | 2012-11-02 | Paper |
| Morphic Primitivity and Alphabet Reductions | 2012-11-02 | Paper |
| Automata with Modulo Counters and Nondeterministic Counter Bounds | 2012-09-20 | Paper |
| Weakly unambiguous morphisms | 2012-08-09 | Paper |
| On multi-head automata with restricted nondeterminism | 2012-07-25 | Paper |
| Patterns with Bounded Treewidth | 2012-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113685 | 2012-01-23 | Paper |
| Restricted ambiguity of erasing morphisms | 2011-07-14 | Paper |
| Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory Access | 2011-06-03 | Paper |
| A Polynomial Time Match Test for Large Classes of Extended Regular Expressions | 2011-02-11 | Paper |
| Restricted Ambiguity of Erasing Morphisms | 2010-08-31 | Paper |
| Existence and nonexistence of descriptive patterns | 2010-08-11 | Paper |
| The unambiguity of segmented morphisms | 2010-04-28 | Paper |
| Bad news on decision problems for patterns | 2010-01-12 | Paper |
| Existence and Nonexistence of Descriptive Patterns | 2009-07-07 | Paper |
| Morphically primitive words | 2009-05-28 | Paper |
| Bad News on Decision Problems for Patterns | 2008-10-30 | Paper |
| An examination of Ohlebusch and Ukkonen's conjecture on the equivalence problem for E-pattern languages | 2008-08-12 | Paper |
| Discontinuities in pattern inference | 2008-05-28 | Paper |
| The Unambiguity of Segmented Morphisms | 2007-11-28 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| UNAMBIGUOUS MORPHIC IMAGES OF STRINGS | 2006-08-14 | Paper |
| Developments in Language Theory | 2006-06-23 | Paper |
| A non-learnable class of E-pattern languages | 2006-03-20 | Paper |
| Developments in Language Theory | 2005-12-22 | Paper |
| Learning Theory | 2005-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4420758 | 2003-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4534773 | 2002-06-11 | Paper |
