| Publication | Date of Publication | Type |
|---|
| Approaching repetition thresholds via local resampling and entropy compression | 2023-11-16 | Paper |
| Abelian repetition threshold revisited | 2022-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088923 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089256 | 2022-07-18 | Paper |
| On minimal critical exponent of balanced sequences | 2022-06-13 | Paper |
| Branching frequency and Markov entropy of repetition-free languages | 2022-03-25 | Paper |
| Computing the maximum exponent in a stream | 2022-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5061517 | 2022-03-11 | Paper |
| Transition property for cube-free words | 2021-08-03 | Paper |
| Counting Palindromes in Substrings | 2021-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3304137 | 2020-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5110889 | 2020-05-25 | Paper |
| String periods in the order-preserving model | 2020-01-17 | Paper |
| Transition property for cube-free words | 2019-10-22 | Paper |
| Subword complexity and power avoidance | 2019-10-07 | Paper |
| Tight tradeoffs for real-time approximation of longest palindromes in streams | 2019-08-20 | Paper |
| More on quantum, stochastic, and pseudo stochastic languages with few states | 2019-07-08 | Paper |
| Transition Property For Cube-Free Words | 2018-12-28 | Paper |
| Comparison of LZ77-type parsings | 2018-11-09 | Paper |
| Square-Free Partial Words with Many Wildcards | 2018-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636645 | 2018-04-19 | Paper |
| EERTREE: an efficient data structure for processing palindromes in strings | 2017-11-14 | Paper |
| Growth of power-free languages over large alphabets | 2017-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369553 | 2017-10-17 | Paper |
| On the tree of binary cube-free words | 2017-10-13 | Paper |
| Lower bounds on words separation: are there short identities in transformation semigroups? | 2017-09-08 | Paper |
| The Number of Distinct Subpalindromes in Random Words | 2017-07-28 | Paper |
| Ternary Square-Free Partial Words with Many Wildcards | 2016-08-30 | Paper |
| Palindromic rich words and run-length encodings | 2016-08-16 | Paper |
| Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 73-Power-Free Infinite Binary Words | 2016-04-15 | Paper |
| EERTREE: an efficient data structure for processing palindromes in strings | 2016-04-04 | Paper |
| On Pansiot Words Avoiding 3-Repetitions | 2016-03-01 | Paper |
| Constructing Premaximal Binary Cube-free Words of Any Level | 2016-03-01 | Paper |
| Fife's Theorem for (7/3)-Powers | 2016-03-01 | Paper |
| On the Tree of Ternary Square-Free Words | 2015-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3450102 | 2015-11-02 | Paper |
| Generating square-free words efficiently | 2015-09-16 | Paper |
| Quantum, Stochastic, and Pseudo Stochastic Languages with Few States | 2015-09-14 | Paper |
| LANGUAGES WITH A FINITE ANTIDICTIONARY: SOME GROWTH QUESTIONS | 2015-04-23 | Paper |
| Pal k is Linear Recognizable Online | 2015-02-20 | Paper |
| Searching for Zimin patterns | 2015-01-30 | Paper |
| Periodic Partial Words and Random Bipartite Graphs | 2014-12-22 | Paper |
| Binary patterns in binary cube-free words: Avoidability and growth | 2014-12-12 | Paper |
| Growth properties of power-free languages | 2014-10-24 | Paper |
| ON PANSIOT WORDS AVOIDING 3-REPETITIONS | 2013-07-30 | Paper |
| CONSTRUCTING PREMAXIMAL BINARY CUBE-FREE WORDS OF ANY LEVEL | 2013-07-30 | Paper |
| Languages with a Finite Antidictionary: Growth-Preserving Transformations and Available Orders of Growth | 2013-06-28 | Paper |
| Constructing Premaximal Ternary Square-Free Words of Any Level | 2012-09-25 | Paper |
| On Two Stronger Versions of Dejean’s Conjecture | 2012-09-25 | Paper |
| On Abelian repetition threshold | 2012-08-31 | Paper |
| ON THE EXISTENCE OF MINIMAL β-POWERS | 2012-08-29 | Paper |
| Deciding context equivalence of binary overlap-free words in linear time | 2012-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115555 | 2012-02-10 | Paper |
| ALMOST OVERLAP-FREE WORDS AND THE WORD PROBLEM FOR THE FREE BURNSIDE SEMIGROUP SATISFYING x2= x3 | 2011-11-10 | Paper |
| Growth Properties of Power-Free Languages | 2011-07-29 | Paper |
| On Brzozowski’s Conjecture for the Free Burnside Semigroup Satisfying x 2 = x 3 | 2011-07-29 | Paper |
| Two Combinatorial Criteria for BWT Images | 2011-06-17 | Paper |
| On ternary square-free circular words | 2010-12-16 | Paper |
| Growth of power-free languages: numerical and asymptotic bounds | 2010-12-08 | Paper |
| Combinatorial Characterization of Formal Languages | 2010-10-26 | Paper |
| On the Existence of Minimal β-Powers | 2010-08-31 | Paper |
| Growth rates of complexity of power-free languages | 2010-08-11 | Paper |
| Growth of Power-Free Languages over Large Alphabets | 2010-06-22 | Paper |
| On the growth rates of complexity of threshold languages | 2010-03-12 | Paper |
| Growth rates of power-free languages | 2009-11-13 | Paper |
| Two-Sided Bounds for the Growth Rates of Power-Free Languages | 2009-07-07 | Paper |
| On intermediate factorial languages | 2009-06-30 | Paper |
| Polynomial languages with finite antidictionaries | 2009-05-06 | Paper |
| Factorial Languages of Low Combinatorial Complexity | 2009-03-26 | Paper |
| Comparing Complexity Functions of a Language and Its Extendable Part | 2008-09-25 | Paper |
| Combinatorial Complexity of Regular Languages | 2008-06-05 | Paper |
| RATIONAL APPROXIMATIONS OF POLYNOMIAL FACTORIAL LANGUAGES | 2007-06-05 | Paper |
| Partial words and the interaction property of periods | 2005-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453442 | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779181 | 2002-11-25 | Paper |
| The structure of the set of cube-free $ Z$-words in a two-letter alphabet | 2001-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508468 | 2001-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4242582 | 1999-05-11 | Paper |
| Syntactic semigroups of avoided languages | 1998-11-22 | Paper |
| Binary avoidability and Thue-Morse words | 1998-09-20 | Paper |
| Binary words avoided by the Thue-Morse sequence | 1997-03-16 | Paper |
| OVERLAP-FREE WORDS AND THUE-MORSE SEQUENCES | 1996-11-13 | Paper |
