| Publication | Date of Publication | Type |
|---|
| Reconstructing words using queries on subwords or factors | 2023-01-04 | Paper |
| Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable | 2022-08-18 | Paper |
| A characterization of binary morphisms generating Lyndon infinite words | 2022-05-20 | Paper |
| On sets of indefinitely desubstitutable words | 2021-01-25 | Paper |
| Coverability and multi-scale coverability on infinite pictures | 2019-06-25 | Paper |
| Characterization of Infinite LSP Words and Endomorphisms Preserving the LSP Property | 2019-06-24 | Paper |
| Computing the closure of sets of words under partial commutations | 2019-01-10 | Paper |
| Greedy Palindromic Lengths | 2018-05-17 | Paper |
| Avoidability of circular formulas | 2018-04-16 | Paper |
| Determining Sets of Quasiperiods of Infinite Words | 2018-03-21 | Paper |
| A characterization of infinite LSP words | 2017-10-13 | Paper |
| Periodicity in rectangular arrays | 2016-11-23 | Paper |
| Coverability in Two Dimensions | 2016-04-08 | Paper |
| Minimal critical exponent of quasiperiodic words | 2014-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5404286 | 2014-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2855577 | 2013-10-25 | Paper |
| On Quasiperiodic Morphisms | 2013-09-20 | Paper |
| Towards a statement of the S-adic conjecture through examples | 2012-08-31 | Paper |
| Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms | 2012-05-30 | Paper |
| Counting distinct palindromes in a word in linear time | 2012-03-27 | Paper |
| On factorially balanced sets of words | 2011-10-10 | Paper |
| AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY | 2011-07-14 | Paper |
| Abelian complexity of minimal subshifts | 2011-02-09 | Paper |
| Optimality of some algorithms to detect quasiperiodicities | 2010-08-11 | Paper |
| Balance and abelian complexity of the Tribonacci word | 2010-07-13 | Paper |
| Standard factors of Sturmian words | 2010-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396619 | 2009-09-19 | Paper |
| Directive words of episturmian words: equivalences and normalization | 2009-05-06 | Paper |
| Abelian Properties of Words (Extended abstract) | 2009-04-19 | Paper |
| Well Quasi Orders and the Shuffle Closure of Finite Sets | 2009-03-26 | Paper |
| Quasiperiodic and Lyndon episturmian words | 2009-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387714 | 2008-05-27 | Paper |
| A Local Balance Property of Episturmian Words | 2007-11-28 | Paper |
| Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms | 2007-09-19 | Paper |
| Well quasi-orders generated by a word-shuffle rewriting | 2007-06-06 | Paper |
| CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS | 2005-06-22 | Paper |
| Overlap-free morphisms and finite test-sets | 2004-11-23 | Paper |
| Some algorithms to compute the conjugates of Episturmian morphisms | 2004-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453456 | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708607 | 2003-06-18 | Paper |
| Some results on \(k\)-power-free morphisms | 2002-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501525 | 2001-05-03 | Paper |
| Characterization of test-sets for overlap-free morphisms | 2000-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4267180 | 1999-09-22 | Paper |
| New results on the star problem in trace monoids | 1995-08-02 | Paper |
