| Publication | Date of Publication | Type |
|---|
| ON GENERALIZED SLENDERNESS OF CONTEXT-FREE LANGUAGES | 2022-12-06 | Paper |
| On a geometric problem of zigzags. | 2016-05-26 | Paper |
| A comparison of index-based Lempel-Ziv LZ77 factorization algorithms | 2014-08-13 | Paper |
| Understanding maximal repetitions in strings | 2013-03-19 | Paper |
| Computing the longest previous factor | 2012-11-15 | Paper |
| Minimum Unique Substrings and Maximum Repeats | 2011-11-22 | Paper |
| The ``runs conjecture | 2011-06-16 | Paper |
| The longest common extension problem revisited and applications to approximate string searching | 2011-01-20 | Paper |
| Computing longest previous factor in linear time and applications | 2010-04-19 | Paper |
| Periodic and Sturmian languages | 2010-01-18 | Paper |
| LPF computation revisited | 2009-12-11 | Paper |
| Repetitions in strings: algorithms and combinatorics | 2009-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396591 | 2009-09-19 | Paper |
| Analysis of Maximal Repetitions in Strings | 2008-09-17 | Paper |
| Maximal repetitions in strings | 2008-06-26 | Paper |
| Towards a Solution to the “Runs” Conjecture | 2008-06-17 | Paper |
| The Lempel–Ziv Complexity of Fixed Points of Morphisms | 2008-05-22 | Paper |
| THE STRUCTURE OF FACTOR ORACLES | 2008-05-20 | Paper |
| Viral Genome Compression | 2008-04-04 | Paper |
| Gene Assembly Algorithms for Ciliates | 2008-04-04 | Paper |
| Factor Oracles | 2007-09-06 | Paper |
| The Lempel-Ziv Complexity of Fixed Points of Morphisms | 2007-09-05 | Paper |
| A note on the number of squares in a word | 2007-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3409986 | 2006-11-21 | Paper |
| On disjunctivity, ultimate periodicity and ultimate identity of Păun-Salomaa self-reading sequences | 2006-09-06 | Paper |
| Combinatorial Pattern Matching | 2005-12-14 | Paper |
| A generalization of repetition threshold | 2005-12-06 | Paper |
| WORD COMPLEXITY AND REPETITIONS IN WORDS | 2005-10-19 | Paper |
| A simple proof that a word of length \(n\) has at most \(2n\) distinct squares | 2005-10-17 | Paper |
| A generalization of repetition threshold | 2005-08-22 | Paper |
| Generalised fine and Wilf's theorem for arbitrary number of periods | 2005-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3022290 | 2005-06-23 | Paper |
| Theory Is Forever | 2005-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808652 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737707 | 2004-08-11 | Paper |
| Follow automata. | 2004-03-14 | Paper |
| Reducing NFAs by invariant equivalences. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453228 | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453440 | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418648 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708581 | 2003-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782114 | 2002-11-27 | Paper |
| An attempt to define a class of mildly context-sensitive languages | 2002-02-13 | Paper |
| Two-variable word equations | 2001-07-23 | Paper |
| A characterization of poly-slender context-free languages | 2001-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4939008 | 2000-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501527 | 2000-09-04 | Paper |
| On lengths of words in context-free languages | 2000-08-21 | Paper |
| On strongly context-free languages | 2000-07-11 | Paper |
| 2-testability and relabelings produce everything | 2000-05-18 | Paper |
| Periods and binary words | 2000-05-11 | Paper |
| On the expressiveness of subset-sum representations | 2000-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4265628 | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4254836 | 1999-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4226191 | 1999-01-24 | Paper |
| On quasi orders of words and the confluence property | 1999-01-20 | Paper |
| On well quasi orders of free monoids | 1999-01-12 | Paper |
| Languages obtained from infinite words | 1999-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3837990 | 1998-11-26 | Paper |
| On computational complexity of contextual languages | 1998-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4355685 | 1997-11-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4358449 | 1997-09-29 | Paper |
| Binary self-adding sequences and languages1 | 1997-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886798 | 1996-07-23 | Paper |
| On subwords of infinite words | 1996-07-07 | Paper |
| On a conjecture about slender context-free languages | 1994-09-25 | Paper |
