| Publication | Date of Publication | Type |
|---|
Reduced complexities for sequences over finite alphabets
Integers | 2026-03-05 | Paper |
| Purely automatic sequences with the uniform distribution property | 2025-11-14 | Paper |
| Words avoiding half-flips | 2025-11-14 | Paper |
Complement avoidance in binary words
The Electronic Journal of Combinatorics | 2025-11-12 | Paper |
The analogue of overlap-freeness for the Fibonacci morphism
RAIRO. Theoretical Informatics and Applications | 2025-09-02 | Paper |
Sums of products of binomial coefficients mod 2 and 2-regular sequences
Integers | 2025-08-12 | Paper |
The lexicographically least binary rich word achieving the repetition threshold
The Electronic Journal of Combinatorics | 2025-01-27 | Paper |
Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers
SIAM Journal on Discrete Mathematics | 2024-12-18 | Paper |
Introduction. Special volume in honor of Jeffrey Shallit on the occasion of his \(60^{\mathrm{th}}\) birthday
Integers | 2024-12-03 | Paper |
Dyck words, pattern avoidance, and automatic sequences
Communications in Mathematics | 2024-10-08 | Paper |
Antisquares and critical exponents
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2024-09-06 | Paper |
A small morphism for which the fixed point has an abelian critical exponent less than 2
RAIRO. Theoretical Informatics and Applications | 2024-06-07 | Paper |
| 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
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
Rudin-Shapiro Sums via Automata Theory and Logic
Lecture Notes in Computer Science | 2023-07-25 | Paper |
Dyck Words, Pattern Avoidance, and Automatic Sequences
Lecture Notes in Computer Science | 2023-07-25 | Paper |
Properties of a ternary infinite word
RAIRO - Theoretical Informatics and Applications | 2023-05-25 | Paper |
| The periodic complexity function of the Thue-Morse word, the Rudin-Shapiro word, and the period-doubling word | 2023-03-21 | Paper |
The periodic complexity function of the Thue-Morse word, the Rudin-Shapiro word, and the period-doubling word
(available as arXiv preprint) | 2023-03-21 | Paper |
Prefixes of the Fibonacci word that end with a cube
Comptes Rendus. Mathématique. Académie des Sciences, Paris | 2023-02-10 | Paper |
Existential length universality
(available as arXiv preprint) | 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
The Electronic Journal of Combinatorics | 2022-09-06 | Paper |
Closed Ziv-Lempel factorization of the \(m\)-bonacci words
Theoretical Computer Science | 2022-05-10 | Paper |
The weak circular repetition threshold over large alphabets
RAIRO - Theoretical Informatics and Applications | 2022-01-12 | Paper |
The periodic complexity function of the Thue-Morse word, the Rudin-Shapiro word, and the period-doubling word
(available as arXiv preprint) | 2021-12-08 | Paper |
Prefixes of the Fibonacci word that end with a cube
(available as arXiv preprint) | 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
(available as arXiv preprint) | 2021-10-12 | Paper |
Closed Ziv-Lempel factorization of the $m$-bonacci words
(available as arXiv preprint) | 2021-06-06 | Paper |
Lengths of extremal square-free ternary words
(available as arXiv preprint) | 2021-04-27 | Paper |
Squarefree words with interior disposable factors
Theoretical Computer Science | 2021-03-18 | Paper |
| scientific article; zbMATH DE number 7315090 (Why is no real title available?) | 2021-02-24 | Paper |
scientific article; zbMATH DE number 7315090 (Why is no real title available?)
(available as arXiv preprint) | 2021-02-24 | Paper |
Extremal overlap-free and extremal \(\beta\)-free binary words
The Electronic Journal of Combinatorics | 2020-12-13 | Paper |
The repetition threshold for binary rich words
(available as arXiv preprint) | 2020-10-28 | Paper |
The number of threshold words on \(n\) letters grows exponentially for every \(n \geq 27\)
(available as arXiv preprint) | 2020-05-12 | 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
(available as arXiv preprint) | 2019-12-22 | Paper |
Cobham’s Theorem and Automaticity
International Journal of Foundations of Computer Science | 2019-12-19 | Paper |
Some further results on squarefree arithmetic progressions in infinite words
Theoretical Computer Science | 2019-11-13 | Paper |
New results on pseudosquare avoidance
(available as arXiv preprint) | 2019-11-06 | Paper |
Palindromic Ziv-Lempel and Crochemore factorizations of \(m\)-bonacci infinite words
Theoretical Computer Science | 2019-09-10 | Paper |
| scientific article; zbMATH DE number 7069796 (Why is no real title available?) | 2019-06-21 | Paper |
Critical exponents of infinite balanced words
Theoretical Computer Science | 2019-06-18 | Paper |
Critical exponents of infinite balanced words
Theoretical Computer Science | 2019-06-18 | Paper |
Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture
The Electronic Journal of Combinatorics | 2019-06-06 | Paper |
Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture
The Electronic Journal of Combinatorics | 2019-06-06 | Paper |
The formal inverse of the period-doubling sequence
(available as arXiv preprint) | 2019-01-22 | Paper |
| The formal inverse of the period-doubling sequence | 2019-01-22 | Paper |
Permutation complexity of images of Sturmian words by marked morphisms
(available as arXiv preprint) | 2018-12-10 | 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 |
| Shuffling and unshuffling | 2018-09-04 | Paper |
Avoidance bases for formulas with reversal
Theoretical Computer Science | 2018-06-18 | Paper |
The Frobenius problem for the shuffle operation
Semigroup Forum | 2018-06-13 | Paper |
Improved estimates for the number of privileged words
(available as arXiv preprint) | 2018-05-14 | Paper |
| Improved estimates for the number of privileged words | 2018-05-14 | Paper |
On avoidability of formulas with reversal
RAIRO - Theoretical Informatics and Applications | 2018-05-04 | Paper |
| Common factors in automatic and Sturmian sequences | 2018-02-01 | Paper |
| Overpals, underlaps, and underpals | 2017-11-15 | Paper |
Repetitions in words
Combinatorics, Words and Symbolic Dynamics | 2017-10-06 | Paper |
A family of formulas with reversal of high avoidability index
International Journal of Algebra and Computation | 2017-10-06 | Paper |
On the asymptotic abelian complexity of morphic words
Advances in Applied Mathematics | 2017-10-05 | Paper |
| Formulas with reversal | 2017-08-04 | Paper |
Avoiding approximate repetitions with respect to the longest common subsequence distance
Involve | 2016-07-29 | Paper |
Avoiding approximate repetitions with respect to the longest common subsequence distance
Involve | 2016-07-29 | Paper |
Initial non-repetitive complexity of infinite words
Discrete Applied Mathematics | 2016-05-18 | Paper |
Fife's theorem for \(\frac 73\)-powers
Electronic Proceedings in Theoretical Computer Science | 2016-03-01 | Paper |
| Binary words avoiding xx^Rx and strongly unimodal sequences | 2015-12-16 | Paper |
Binary words avoiding xx^Rx and strongly unimodal sequences
(available as arXiv preprint) | 2015-12-16 | Paper |
Growth rate of binary words avoiding \(xxx^{R}\)
Theoretical Computer Science | 2015-12-08 | Paper |
Words with many palindrome pair factors
The Electronic Journal of Combinatorics | 2015-11-02 | Paper |
Words with many palindrome pair factors
The Electronic Journal of Combinatorics | 2015-11-02 | Paper |
Suffix conjugates for a class of morphic subshifts
Ergodic Theory and Dynamical Systems | 2015-09-11 | Paper |
On the number of abelian bordered words (with an example of automatic theorem-proving)
International Journal of Foundations of Computer Science | 2015-04-23 | Paper |
Some properties of a Rudin-Shapiro-like sequence
Advances in Applied Mathematics | 2014-12-09 | Paper |
| Abelian complexity of fixed point of morphism \(0 \mapsto 012, 1 \mapsto 02, 2 \mapsto 1\) | 2014-04-09 | Paper |
| Concerning Kurosaki's squarefree word | 2014-03-24 | Paper |
Concerning Kurosaki's squarefree word
(available as arXiv preprint) | 2014-03-24 | Paper |
| On highly repetitive and power free words | 2014-03-24 | Paper |
A note on abelian returns in rotation words
Theoretical Computer Science | 2014-03-13 | Paper |
Extremal words in morphic subshifts
Discrete Mathematics | 2014-02-27 | Paper |
| Automaticity of primitive words and irreducible polynomials | 2014-02-14 | Paper |
Cubefree words with many squares
(available as arXiv preprint) | 2014-02-03 | Paper |
| Cubefree words with many squares | 2014-02-03 | Paper |
The minimal automaton recognizing \(m\mathbb N\) in a linear numeration system
Integers | 2013-10-25 | Paper |
Suffix Conjugates for a Class of Morphic Subshifts
Lecture Notes in Computer Science | 2013-09-20 | Paper |
Non-constructive Methods for Avoiding Repetitions in Words
Lecture Notes in Computer Science | 2013-09-20 | Paper |
On the number of abelian bordered words
Developments in Language Theory | 2013-06-28 | Paper |
Extremal words in the shift orbit closure of a morphic sequence
Developments in Language Theory | 2013-06-28 | Paper |
Inverse star, borders, and palstars
Information Processing Letters | 2013-03-28 | Paper |
The abelian complexity of the paperfolding word
Discrete Mathematics | 2013-03-15 | Paper |
Abelian primitive words
International Journal of Foundations of Computer Science | 2013-01-18 | Paper |
Enumeration and decidable properties of automatic sequences
International Journal of Foundations of Computer Science | 2013-01-18 | Paper |
Multi-dimensional sets recognizable in all abstract numeration systems
RAIRO. Theoretical Informatics and Applications | 2012-08-31 | Paper |
Multi-dimensional sets recognizable in all abstract numeration systems
RAIRO. Theoretical Informatics and Applications | 2012-08-31 | Paper |
Syntactic complexity of ultimately periodic sets of integers and application to a decision procedure
Fundamenta Informaticae | 2012-06-20 | Paper |
The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages
Fundamenta Informaticae | 2012-06-20 | Paper |
Fixed points avoiding abelian \(k\)-powers
Journal of Combinatorial Theory. Series A | 2012-05-04 | Paper |
The growth function of \(S\)-recognizable sets
Theoretical Computer Science | 2011-10-10 | Paper |
Enumeration and decidable properties of automatic sequences
Developments in Language Theory | 2011-07-29 | Paper |
Abelian Primitive Words
Developments in Language Theory | 2011-07-29 | Paper |
On highly repetitive and power free words
Developments in Language Theory | 2011-07-29 | Paper |
Further applications of a power series method for pattern avoidance
The Electronic Journal of Combinatorics | 2011-06-24 | Paper |
Further applications of a power series method for pattern avoidance
The Electronic Journal of Combinatorics | 2011-06-24 | Paper |
Further applications of a power series method for pattern avoidance
The Electronic Journal of Combinatorics | 2011-06-24 | Paper |
Recurrent words with constant abelian complexity
Advances in Applied Mathematics | 2011-06-14 | Paper |
Abstract numeration systems
Language and Automata Theory and Applications | 2011-06-03 | Paper |
A proof of Dejean’s conjecture
Mathematics of Computation | 2011-04-19 | Paper |
On the complexity of deciding avoidability of sets of partial words
Theoretical Computer Science | 2010-11-19 | Paper |
Finding the growth rate of a regular or context-free language in polynomial time
International Journal of Foundations of Computer Science | 2010-09-06 | Paper |
Detecting patterns in finite regular and context-free languages
Information Processing Letters | 2010-09-02 | Paper |
There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\)
Discrete Applied Mathematics | 2010-04-28 | Paper |
Infinite words containing squares at every position
RAIRO - Theoretical Informatics and Applications | 2010-03-12 | Paper |
Infinite words containing squares at every position
RAIRO - Theoretical Informatics and Applications | 2010-03-12 | Paper |
On the context-freeness of the set of words containing overlaps
Information Processing Letters | 2010-01-29 | Paper |
The state complexity of \(L^{2}\) and \(L^k\)
Information Processing Letters | 2010-01-18 | Paper |
Dejean's conjecture holds for N ≥ 27
RAIRO - Theoretical Informatics and Applications | 2009-12-18 | Paper |
Dejean's conjecture holds for N ≥ 27
RAIRO - Theoretical Informatics and Applications | 2009-12-18 | Paper |
On NFAs where all states are final, initial, or both
Theoretical Computer Science | 2009-11-06 | Paper |
| scientific article; zbMATH DE number 5605145 (Why is no real title available?) | 2009-09-19 | Paper |
Periodicity, repetitions, and orbits of an automatic sequence
Theoretical Computer Science | 2009-08-07 | Paper |
Dejean's conjecture holds for \(n\geq 30\)
Theoretical Computer Science | 2009-08-07 | Paper |
On the Complexity of Deciding Avoidability of Sets of Partial Words
Developments in Language Theory | 2009-07-07 | Paper |
Decimations of languages and state complexity
Theoretical Computer Science | 2009-06-04 | Paper |
State complexity of unique rational operations
Theoretical Computer Science | 2009-06-04 | Paper |
For each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha \)
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
For each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha \)
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
For each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha \)
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
AVOIDING APPROXIMATE SQUARES
International Journal of Foundations of Computer Science | 2008-11-24 | Paper |
Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time
Developments in Language Theory | 2008-10-30 | Paper |
On patterns occurring in binary algebraic numbers
Proceedings of the American Mathematical Society | 2008-09-01 | Paper |
Words avoiding repetitions in arithmetic progressions
Theoretical Computer Science | 2008-03-05 | Paper |
Avoiding Approximate Squares
Developments in Language Theory | 2007-11-28 | Paper |
Binary words containing infinitely many overlaps
The Electronic Journal of Combinatorics | 2007-03-12 | Paper |
Binary words containing infinitely many overlaps
The Electronic Journal of Combinatorics | 2007-03-12 | Paper |
Binary words containing infinitely many overlaps
The Electronic Journal of Combinatorics | 2007-03-12 | Paper |
Squares and overlaps in the Thue-Morse sequence and some variants
RAIRO - Theoretical Informatics and Applications | 2007-02-08 | Paper |
Squares and overlaps in the Thue-Morse sequence and some variants
RAIRO - Theoretical Informatics and Applications | 2007-02-08 | Paper |
Squares and overlaps in the Thue-Morse sequence and some variants
RAIRO - Theoretical Informatics and Applications | 2007-02-08 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
scientific article; zbMATH DE number 2235059 (Why is no real title available?)
(available as arXiv preprint) | 2005-12-02 | Paper |
WORDS AVOIDING $\frac{7}{3}$-POWERS AND THE THUE–MORSE MORPHISM
International Journal of Foundations of Computer Science | 2005-08-03 | Paper |
| scientific article; zbMATH DE number 2186883 (Why is no real title available?) | 2005-07-11 | Paper |
| scientific article; zbMATH DE number 2186883 (Why is no real title available?) | 2005-07-11 | Paper |
Avoiding large squares in infinite binary words
Theoretical Computer Science | 2005-06-30 | Paper |
On integer sequences whose first iterates are linear
Aequationes Mathematicae | 2005-04-29 | Paper |
| There are exponentially many ternary words that avoid abelian cubes | 2004-03-23 | Paper |
| scientific article; zbMATH DE number 2051164 (Why is no real title available?) | 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 |
Antisquares and Critical Exponents
(available as arXiv preprint) | N/A | Paper |
