| Publication | Date of Publication | Type |
|---|
| A small morphism giving Abelian repetition threshold less than 2 | 2023-12-27 | Paper |
| The analogue of overlap-freeness for the Fibonacci morphism | 2023-11-21 | Paper |
| Correlations of minimal forbidden factors of the Fibonacci word | 2023-09-13 | Paper |
| Sums of products of binomial coefficients mod 2 and 2-regular sequences | 2023-09-07 | Paper |
| An Inequality for the Number of Periods in a Word | 2023-08-15 | Paper |
| Rudin-Shapiro Sums via Automata Theory and Logic | 2023-07-25 | Paper |
| Dyck Words, Pattern Avoidance, and Automatic Sequences | 2023-07-25 | Paper |
| Properties of a ternary infinite word | 2023-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5883504 | 2023-03-21 | Paper |
| Prefixes of the Fibonacci word that end with a cube | 2023-02-10 | Paper |
| Existential length universality | 2023-02-07 | Paper |
| Complement Avoidance in Binary Words | 2022-09-20 | Paper |
| Congruence properties of combinatorial sequences via walnut and the Rowland-Yassawi-Zeilberger automaton | 2022-09-06 | Paper |
| Closed Ziv-Lempel factorization of the \(m\)-bonacci words | 2022-05-10 | Paper |
| The weak circular repetition threshold over large alphabets | 2022-01-12 | Paper |
| The periodic complexity function of the Thue-Morse word, the Rudin-Shapiro word, and the period-doubling word | 2021-12-08 | Paper |
| Prefixes of the Fibonacci word that end with a cube | 2021-11-17 | Paper |
| Extending Dekking's construction of an infinite binary word avoiding abelian $4$-powers | 2021-11-15 | Paper |
| Congruence properties of combinatorial sequences via Walnut and the Rowland-Yassawi-Zeilberger automaton | 2021-10-12 | Paper |
| Closed Ziv-Lempel factorization of the $m$-bonacci words | 2021-06-06 | Paper |
| Lengths of extremal square-free ternary words. | 2021-04-27 | Paper |
| Squarefree words with interior disposable factors | 2021-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4964009 | 2021-02-24 | Paper |
| Extremal overlap-free and extremal \(\beta\)-free binary words | 2020-12-13 | Paper |
| The repetition threshold for binary rich words | 2020-10-28 | Paper |
| The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$ | 2020-05-12 | Paper |
| The Weak Circular Repetition Threshold Over Large Alphabets | 2019-12-22 | Paper |
| Cobham’s Theorem and Automaticity | 2019-12-19 | Paper |
| Some further results on squarefree arithmetic progressions in infinite words | 2019-11-13 | Paper |
| New results on pseudosquare avoidance | 2019-11-06 | Paper |
| Palindromic Ziv-Lempel and Crochemore factorizations of \(m\)-bonacci infinite words | 2019-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5384332 | 2019-06-21 | Paper |
| Critical exponents of infinite balanced words | 2019-06-18 | Paper |
| Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture | 2019-06-06 | Paper |
| The Formal Inverse of the Period-Doubling Sequence | 2019-01-22 | Paper |
| Permutation complexity of images of Sturmian words by marked morphisms | 2018-12-10 | Paper |
| On some problems of Harju concerning squarefree arithmetic progressions in infinite words | 2018-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4584890 | 2018-09-04 | Paper |
| Avoidance bases for formulas with reversal | 2018-06-18 | Paper |
| The Frobenius problem for the shuffle operation | 2018-06-13 | Paper |
| Improved estimates for the number of privileged words | 2018-05-14 | Paper |
| On avoidability of formulas with reversal | 2018-05-04 | Paper |
| Common factors in automatic and Sturmian sequences | 2018-02-01 | Paper |
| Overpals, underlaps, and underpals | 2017-11-15 | Paper |
| A family of formulas with reversal of high avoidability index | 2017-10-06 | Paper |
| Repetitions in words | 2017-10-06 | Paper |
| On the asymptotic abelian complexity of morphic words | 2017-10-05 | Paper |
| Formulas with reversal | 2017-08-04 | Paper |
| Avoiding approximate repetitions with respect to the longest common subsequence distance | 2016-07-29 | Paper |
| Initial non-repetitive complexity of infinite words | 2016-05-18 | Paper |
| Fife's Theorem for (7/3)-Powers | 2016-03-01 | Paper |
| Binary words avoiding xx^Rx and strongly unimodal sequences | 2015-12-16 | Paper |
| Growth rate of binary words avoiding \(xxx^{R}\) | 2015-12-08 | Paper |
| Words with many palindrome pair factors | 2015-11-02 | Paper |
| Suffix conjugates for a class of morphic subshifts | 2015-09-11 | Paper |
| ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING) | 2015-04-23 | Paper |
| Some properties of a Rudin-Shapiro-like sequence | 2014-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5408177 | 2014-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5404287 | 2014-03-24 | Paper |
| Concerning Kurosaki's squarefree word | 2014-03-24 | Paper |
| A note on abelian returns in rotation words | 2014-03-13 | Paper |
| Extremal words in morphic subshifts | 2014-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5747369 | 2014-02-14 | Paper |
| Cubefree words with many squares | 2014-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2855521 | 2013-10-25 | Paper |
| Non-constructive Methods for Avoiding Repetitions in Words | 2013-09-20 | Paper |
| Suffix Conjugates for a Class of Morphic Subshifts | 2013-09-20 | Paper |
| Extremal Words in the Shift Orbit Closure of a Morphic Sequence | 2013-06-28 | Paper |
| On the Number of Abelian Bordered Words | 2013-06-28 | Paper |
| Inverse star, borders, and palstars | 2013-03-28 | Paper |
| The abelian complexity of the paperfolding word | 2013-03-15 | Paper |
| ABELIAN PRIMITIVE WORDS | 2013-01-18 | Paper |
| ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES | 2013-01-18 | Paper |
| Multi-dimensional sets recognizable in all abstract numeration systems | 2012-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2893309 | 2012-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2893312 | 2012-06-20 | Paper |
| Fixed points avoiding abelian \(k\)-powers | 2012-05-04 | Paper |
| The growth function of \(S\)-recognizable sets | 2011-10-10 | Paper |
| Enumeration and Decidable Properties of Automatic Sequences | 2011-07-29 | Paper |
| Abelian Primitive Words | 2011-07-29 | Paper |
| On Highly Repetitive and Power Free Words | 2011-07-29 | Paper |
| Further applications of a power series method for pattern avoidance | 2011-06-24 | Paper |
| Recurrent words with constant abelian complexity | 2011-06-14 | Paper |
| Abstract Numeration Systems | 2011-06-03 | Paper |
| A proof of Dejean’s conjecture | 2011-04-19 | Paper |
| On the complexity of deciding avoidability of sets of partial words | 2010-11-19 | Paper |
| FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME | 2010-09-06 | Paper |
| Detecting patterns in finite regular and context-free languages | 2010-09-02 | Paper |
| There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\) | 2010-04-28 | Paper |
| Infinite words containing squares at every position | 2010-03-12 | Paper |
| On the context-freeness of the set of words containing overlaps | 2010-01-29 | Paper |
| The state complexity of \(L^{2}\) and \(L^k\) | 2010-01-18 | Paper |
| Dejean's conjecture holds for N ≥ 27 | 2009-12-18 | Paper |
| On NFAs where all states are final, initial, or both | 2009-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396643 | 2009-09-19 | Paper |
| Periodicity, repetitions, and orbits of an automatic sequence | 2009-08-07 | Paper |
| Dejean's conjecture holds for \(n\geq 30\) | 2009-08-07 | Paper |
| On the Complexity of Deciding Avoidability of Sets of Partial Words | 2009-07-07 | Paper |
| Decimations of languages and state complexity | 2009-06-04 | Paper |
| State complexity of unique rational operations | 2009-06-04 | Paper |
| For each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha \) | 2009-04-07 | Paper |
| AVOIDING APPROXIMATE SQUARES | 2008-11-24 | Paper |
| Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time | 2008-10-30 | Paper |
| On patterns occurring in binary algebraic numbers | 2008-09-01 | Paper |
| Words avoiding repetitions in arithmetic progressions | 2008-03-05 | Paper |
| Avoiding Approximate Squares | 2007-11-28 | Paper |
| Binary words containing infinitely many overlaps | 2007-03-12 | Paper |
| Squares and overlaps in the Thue-Morse sequence and some variants | 2007-02-08 | Paper |
| Developments in Language Theory | 2005-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5710443 | 2005-12-02 | Paper |
| WORDS AVOIDING $\frac{7}{3}$-POWERS AND THE THUE–MORSE MORPHISM | 2005-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024004 | 2005-07-11 | Paper |
| Avoiding large squares in infinite binary words | 2005-06-30 | Paper |
| On integer sequences whose first iterates are linear | 2005-04-29 | Paper |
| There are exponentially many ternary words that avoid abelian cubes | 2004-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453455 | 2004-03-07 | Paper |
| A note on avoidable words in squarefree ternary words | 2003-07-28 | Paper |
| A note on non-repetitive colourings of planar graphs | 2003-07-28 | Paper |
