2024
A Small Morphism for which the Fixed Point has an Abelian Critical Exponent Less than 2.
RAIRO Theor. Informatics Appl., 2024
Repetition Threshold for Binary Automatic Sequences.
CoRR, 2024
2023
Properties of a ternary infinite word.
RAIRO Theor. Informatics Appl., 2023
A small morphism giving Abelian repetition threshold less than 2.
CoRR, 2023
The analogue of overlap-freeness for the Fibonacci morphism.
CoRR, 2023
The Lexicographically Least Binary Rich Word Achieving the Repetition Threshold.
CoRR, 2023
Sums of products of binomial coefficients mod 2 and 2-regular sequences.
CoRR, 2023
Rudin-Shapiro Sums via Automata Theory and Logic.
Proceedings of the Combinatorics on Words - 14th International Conference, 2023
Dyck Words, Pattern Avoidance, and Automatic Sequences.
Proceedings of the Combinatorics on Words - 14th International Conference, 2023
2022
Closed Ziv-Lempel factorization of the <i>m</i>-bonacci words.
Theor. Comput. Sci., 2022
Complement Avoidance in Binary Words.
CoRR, 2022
Antisquares and Critical Exponents.
CoRR, 2022
Congruence Properties of Combinatorial Sequences via Walnut and the Rowland-Yassawi-Zeilberger Automaton.
Electron. J. Comb., 2022
2021
Squarefree words with interior disposable factors.
Theor. Comput. Sci., 2021
An Inequality for the Number of Periods in a Word.
Int. J. Found. Comput. Sci., 2021
The periodic complexity function of the Thue-Morse word and the Rudin-Shapiro word.
CoRR, 2021
Prefixes of the Fibonacci word that end with a cube.
CoRR, 2021
Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers.
CoRR, 2021
Closed Ziv-Lempel factorization of the m-bonacci words.
CoRR, 2021
Lengths of extremal square-free ternary words.
Contributions Discret. Math., 2021
2020
The Number of Threshold Words on n Letters Grows Exponentially for Every n ≥ 27.
J. Integer Seq., 2020
The weak circular repetition threshold over large alphabets.
RAIRO Theor. Informatics Appl., 2020
The repetition threshold for binary rich words.
Discret. Math. Theor. Comput. Sci., 2020
Extremal overlap-free and extremal β-free binary words.
CoRR, 2020
Extremal Overlap-Free and Extremal $\beta$-Free Binary Words.
Electron. J. Comb., 2020
Existential Length Universality.
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020
2019
Critical exponents of infinite balanced words.
Theor. Comput. Sci., 2019
Palindromic Ziv-Lempel and Crochemore factorizations of <i>m</i>-bonacci infinite words.
Theor. Comput. Sci., 2019
Some further results on squarefree arithmetic progressions in infinite words.
Theor. Comput. Sci., 2019
Cobham's Theorem and Automaticity.
Int. J. Found. Comput. Sci., 2019
Palindromic Ziv-Lempel and Crochemore Factorizations of m-Bonacci Infinite Words.
CoRR, 2019
Circular Repetition Thresholds on Some Small Alphabets: Last Cases of Gorbunova's Conjecture.
Electron. J. Comb., 2019
New Results on Pseudosquare Avoidance.
Proceedings of the Combinatorics on Words - 12th International Conference, 2019
2018
Avoidance bases for formulas with reversal.
Theor. Comput. Sci., 2018
The Formal Inverse of the Period-Doubling Sequence.
J. Integer Seq., 2018
Improved Estimates for the Number of Privileged Words.
J. Integer Seq., 2018
Cyclic Complexity of Some Infinite Words and Generalizations.
Integers, 2018
Permutation complexity of images of Sturmian words by marked morphisms.
Discret. Math. Theor. Comput. Sci., 2018
Common factors in automatic and Sturmian sequences.
CoRR, 2018
2017
On avoidability of formulas with reversal.
RAIRO Theor. Informatics Appl., 2017
A family of formulas with reversal of high avoidability index.
Int. J. Algebra Comput., 2017
Existential length universality.
CoRR, 2017
Overpals, Underlaps, and Underpals.
Proceedings of the Combinatorics on Words - 11th International Conference, 2017
Proceedings of the Unveiling Dynamics and Complexity, 2017
2016
Growth rate of binary words avoiding xxx<sup>R</sup>.
Theor. Comput. Sci., 2016
Initial non-repetitive complexity of infinite words.
Discret. Appl. Math., 2016
The Frobenius problem for the shuffle operation.
CoRR, 2016
2015
Binary Words Avoiding x xR x and Strongly Unimodal Sequences.
J. Integer Seq., 2015
Non-repetitive complexity of infinite words.
CoRR, 2015
Binary words avoiding xx^Rx and strongly unimodal sequences.
CoRR, 2015
Words with many Palindrome Pair Factors.
Electron. J. Comb., 2015
Some properties of a Rudin-Shapiro-like sequence.
Adv. Appl. Math., 2015
2014
A note on abelian returns in rotation words.
Theor. Comput. Sci., 2014
Abelian Complexity of Fixed Point of Morphism 0 ↦ 012, 1 ↦ 02, 2 ↦ 1.
Integers, 2014
On the number of Abelian Bordered Words (with an Example of Automatic Theorem-Proving).
Int. J. Found. Comput. Sci., 2014
Extremal words in morphic subshifts.
Discret. Math., 2014
On the asymptotic abelian complexity of morphic words.
Adv. Appl. Math., 2014
2013
Automaticity of Primitive Words and Irreducible Polynomials.
Discret. Math. Theor. Comput. Sci., 2013
The abelian complexity of the paperfolding word.
Discret. Math., 2013
Suffix conjugates for a class of morphic subshifts.
CoRR, 2013
On the Number of Abelian Bordered Words.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013
Extremal Words in the Shift Orbit Closure of a Morphic Sequence.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013
Non-constructive Methods for Avoiding Repetitions in Words.
Proceedings of the Combinatorics on Words - 9th International Conference, 2013
Suffix Conjugates for a Class of Morphic Subshifts - (Extended Abstract).
Proceedings of the Combinatorics on Words - 9th International Conference, 2013
2012
Fixed points avoiding Abelian k-powers.
J. Comb. Theory A, 2012
Multi-dimensional sets recognizable in all abstract numeration systems.
RAIRO Theor. Informatics Appl., 2012
Int. J. Found. Comput. Sci., 2012
Enumeration and Decidable Properties of Automatic Sequences.
Int. J. Found. Comput. Sci., 2012
The Computational Complexity of Universality Problems for Prefixes, Suffixes, Factors, and Subwords of Regular Languages.
Fundam. Informaticae, 2012
Syntactic Complexity of Ultimately Periodic Sets of Integers and Application to a Decision Procedure.
Fundam. Informaticae, 2012
Shuffling and Unshuffling.
Bull. EATCS, 2012
2011
The growth function of S-recognizable sets.
Theor. Comput. Sci., 2011
A proof of Dejean's conjecture.
Math. Comput., 2011
Inverse star, borders, and palstars.
Inf. Process. Lett., 2011
The Minimal Automaton Recognizing mN in a Linear Numeration System.
Integers, 2011
Shuffling and Unshuffling
CoRR, 2011
Fife's Theorem for (7/3)-Powers
Proceedings of the Proceedings 8th International Conference Words 2011, 2011
Further Applications of a Power Series Method for Pattern Avoidance.
Electron. J. Comb., 2011
Recurrent words with constant Abelian complexity.
Adv. Appl. Math., 2011
Abstract Numeration Systems.
Proceedings of the Language and Automata Theory and Applications, 2011
On Highly Repetitive and Power Free Words.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011
2010
On the complexity of deciding avoidability of sets of partial words.
Theor. Comput. Sci., 2010
Infinite words containing squares at every position.
RAIRO Theor. Informatics Appl., 2010
Detecting patterns in finite regular and context-free languages.
Inf. Process. Lett., 2010
Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time.
Int. J. Found. Comput. Sci., 2010
Cubefree words with many squares.
Discret. Math. Theor. Comput. Sci., 2010
State Complexity of Testing Divisibility
Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010
2009
State complexity of unique rational operations.
Theor. Comput. Sci., 2009
Decimations of languages and state complexity.
Theor. Comput. Sci., 2009
On NFAs where all states are final, initial, or both.
Theor. Comput. Sci., 2009
Dejean's conjecture holds for n>=30.
Theor. Comput. Sci., 2009
Periodicity, repetitions, and orbits of an automatic sequence.
Theor. Comput. Sci., 2009
Dejean's conjecture holds for $\sf {N\ge 27}$.
RAIRO Theor. Informatics Appl., 2009
Detecting palindromes, patterns and borders in regular languages.
Inf. Comput., 2009
There are k-uniform cubefree binary morphisms for all k>=0.
Discret. Appl. Math., 2009
Automata and Reduced Words in the Free Group
CoRR, 2009
Dejean's conjecture holds for n>=27.
CoRR, 2009
2008
Words avoiding repetitions in arithmetic progressions.
Theor. Comput. Sci., 2008
Avoiding Approximate Squares.
Int. J. Found. Comput. Sci., 2008
Avoiding Sufficiently Large Binary Patterns.
Bull. EATCS, 2008
On NFAs Where All States are Final, Initial, or Both
CoRR, 2008
For each α > 2 there is an Infinite Binary Word with Critical Exponent α.
Electron. J. Comb., 2008
Finite Automata, Palindromes, Powers, and Patterns.
Proceedings of the Language and Automata Theory and Applications, 2008
Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008
2007
On the context-freeness of the set of words containing overlaps.
Inf. Process. Lett., 2007
Finding the growth rate of a regular language in polynomial time
CoRR, 2007
Finite automata, palindromes, patterns, and borders
CoRR, 2007
Avoiding Approximate Squares.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007
2006
Squares and overlaps in the Thue-Morse sequence and some variants.
RAIRO Theor. Informatics Appl., 2006
The state complexity of L<sup>2</sup> and L<sup>k</sup>.
Inf. Process. Lett., 2006
Binary Words Containing Infinitely Many Overlaps.
Electron. J. Comb., 2006
2005
Avoiding large squares in infinite binary words.
Theor. Comput. Sci., 2005
Words avoiding 7/3-powers and the thue-morse morphism.
Int. J. Found. Comput. Sci., 2005
2003
Cubefree binary words avoiding long squares
CoRR, 2003
