Narad Rampersad

CoRR, April, 2026

Complexity of Linear Subsequences of Fibonacci-Automatic Sequences.

[BibT_eX]

[DOI]

Delaram Moradi

Proceedings of the Developments in Language Theory - 30th International Conference, 2026

2025

Complexity of Linear Subsequences of k-Automatic Sequences.

[BibT_eX]

[DOI]

Delaram Moradi

CoRR, December, 2025

Reduced complexities for sequences over finite alphabets.

[BibT_eX]

[DOI]

John M. Campbell

CoRR, September, 2025

Low complexity binary words avoiding (5/2)+-powers.

[BibT_eX]

[DOI]

CoRR, June, 2025

The analogue of overlap-freeness for the Fibonacci morphism.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2025

Repetition Factorization of Automatic Sequences.

[BibT_eX]

[DOI]

Xinhao Xu

Int. J. Found. Comput. Sci., 2025

Low complexity binary words avoiding $(5/2)^+$-powers.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2025

Complement Avoidance in Binary Words.

[BibT_eX]

[DOI]

Electron. J. Comb., 2025

Purely Automatic Sequences with the Uniform Distribution Property.

[BibT_eX]

[DOI]

Shuo Li

Proceedings of the Combinatorics on Words - 15th International Conference, 2025

Words Avoiding Half-Flips.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 15th International Conference, 2025

2024

Extending Dekking's Construction of an Infinite Binary Word Avoiding Abelian 4-Powers.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2024

A Small Morphism for which the Fixed Point has an Abelian Critical Exponent Less than 2.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2024

Repetition Threshold for Binary Automatic Sequences.

[BibT_eX]

[DOI]

Jean-Paul Allouche

CoRR, 2024

The Lexicographically Least Binary Rich Word Achieving the Repetition Threshold.

[BibT_eX]

[DOI]

Electron. J. Comb., 2024

2023

Properties of a ternary infinite word.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2023

Antisquares and Critical Exponents.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2023

A small morphism giving Abelian repetition threshold less than 2.

[BibT_eX]

[DOI]

CoRR, 2023

Sums of products of binomial coefficients mod 2 and 2-regular sequences.

[BibT_eX]

[DOI]

Max Wiebe

CoRR, 2023

Rudin-Shapiro Sums via Automata Theory and Logic.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 14th International Conference, 2023

Dyck Words, Pattern Avoidance, and Automatic Sequences.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 14th International Conference, 2023

2022

Closed Ziv-Lempel factorization of the m-bonacci words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Complement Avoidance in Binary Words.

[BibT_eX]

[DOI]

CoRR, 2022

Congruence Properties of Combinatorial Sequences via Walnut and the Rowland-Yassawi-Zeilberger Automaton.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

2021

Squarefree words with interior disposable factors.

[BibT_eX]

[DOI]

Marko Milosevic

Theor. Comput. Sci., 2021

An Inequality for the Number of Periods in a Word.

[BibT_eX]

[DOI]

Daniel Gabric

Int. J. Found. Comput. Sci., 2021

The periodic complexity function of the Thue-Morse word and the Rudin-Shapiro word.

[BibT_eX]

[DOI]

CoRR, 2021

Prefixes of the Fibonacci word that end with a cube.

[BibT_eX]

[DOI]

CoRR, 2021

Closed Ziv-Lempel factorization of the m-bonacci words.

[BibT_eX]

[DOI]

CoRR, 2021

Lengths of extremal square-free ternary words.

[BibT_eX]

[DOI]

Contributions Discret. Math., 2021

2020

The Number of Threshold Words on n Letters Grows Exponentially for Every n ≥ 27.

[BibT_eX]

[DOI]

J. Integer Seq., 2020

The weak circular repetition threshold over large alphabets.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2020

The repetition threshold for binary rich words.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2020

Extremal overlap-free and extremal β-free binary words.

[BibT_eX]

[DOI]

CoRR, 2020

Extremal Overlap-Free and Extremal $\beta$-Free Binary Words.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

Existential Length Universality.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

2019

Critical exponents of infinite balanced words.

[BibT_eX]

[DOI]

Élise Vandomme

Theor. Comput. Sci., 2019

Palindromic Ziv-Lempel and Crochemore factorizations of m-bonacci infinite words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Some further results on squarefree arithmetic progressions in infinite words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Cobham's Theorem and Automaticity.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2019

Palindromic Ziv-Lempel and Crochemore Factorizations of m-Bonacci Infinite Words.

[BibT_eX]

[DOI]

CoRR, 2019

Circular Repetition Thresholds on Some Small Alphabets: Last Cases of Gorbunova's Conjecture.

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

New Results on Pseudosquare Avoidance.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 12th International Conference, 2019

2018

Avoidance bases for formulas with reversal.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

The Formal Inverse of the Period-Doubling Sequence.

[BibT_eX]

[DOI]

J. Integer Seq., 2018

Improved Estimates for the Number of Privileged Words.

[BibT_eX]

[DOI]

J. Integer Seq., 2018

Cyclic Complexity of Some Infinite Words and Generalizations.

[BibT_eX]

[DOI]

Colin Krawchuk

Integers, 2018

Permutation complexity of images of Sturmian words by marked morphisms.

[BibT_eX]

[DOI]

Adam Borchert

Discret. Math. Theor. Comput. Sci., 2018

Common factors in automatic and Sturmian sequences.

[BibT_eX]

[DOI]

CoRR, 2018

2017

On avoidability of formulas with reversal.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2017

A family of formulas with reversal of high avoidability index.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2017

Existential length universality.

[BibT_eX]

[DOI]

CoRR, 2017

Overpals, Underlaps, and Underpals.

[BibT_eX]

[DOI]

Aayush Rajasekaran

Proceedings of the Combinatorics on Words - 11th International Conference, 2017

Formulas with Reversal.

[BibT_eX]

[DOI]

Proceedings of the Unveiling Dynamics and Complexity, 2017

2016

Growth rate of binary words avoiding xxxR.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Initial non-repetitive complexity of infinite words.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

The Frobenius problem for the shuffle operation.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Binary Words Avoiding x xR x and Strongly Unimodal Sequences.

[BibT_eX]

[DOI]

J. Integer Seq., 2015

Non-repetitive complexity of infinite words.

[BibT_eX]

[DOI]

CoRR, 2015

Binary words avoiding xx^Rx and strongly unimodal sequences.

[BibT_eX]

[DOI]

CoRR, 2015

Words with many Palindrome Pair Factors.

[BibT_eX]

[DOI]

Adam Borchert

Electron. J. Comb., 2015

Some properties of a Rudin-Shapiro-like sequence.

[BibT_eX]

[DOI]

Philip Lafrance

Randy Yee

Adv. Appl. Math., 2015

2014

A note on abelian returns in rotation words.

[BibT_eX]

[DOI]

Michel Rigo

Pavel Salimov

Theor. Comput. Sci., 2014

Abelian Complexity of Fixed Point of Morphism 0 ↦ 012, 1 ↦ 02, 2 ↦ 1.

[BibT_eX]

[DOI]

Francine Blanchet-Sadri

Nathan Fox

Integers, 2014

On the number of Abelian Bordered Words (with an Example of Automatic Theorem-Proving).

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2014

Extremal words in morphic subshifts.

[BibT_eX]

[DOI]

Discret. Math., 2014

On the asymptotic abelian complexity of morphic words.

[BibT_eX]

[DOI]

Francine Blanchet-Sadri

Nathan Fox

Adv. Appl. Math., 2014

2013

Automaticity of Primitive Words and Irreducible Polynomials.

[BibT_eX]

[DOI]

Anne Lacroix

Discret. Math. Theor. Comput. Sci., 2013

The abelian complexity of the paperfolding word.

[BibT_eX]

[DOI]

Blake Madill

Discret. Math., 2013

Suffix conjugates for a class of morphic subshifts.

[BibT_eX]

[DOI]

Kalle Saari

CoRR, 2013

On the Number of Abelian Bordered Words.

[BibT_eX]

[DOI]

Michel Rigo

Pavel Salimov

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Extremal Words in the Shift Orbit Closure of a Morphic Sequence.

[BibT_eX]

[DOI]

Kalle Saari

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Non-constructive Methods for Avoiding Repetitions in Words.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 9th International Conference, 2013

Suffix Conjugates for a Class of Morphic Subshifts - (Extended Abstract).

[BibT_eX]

[DOI]

Kalle Saari

Proceedings of the Combinatorics on Words - 9th International Conference, 2013

2012

Fixed points avoiding Abelian k-powers.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2012

Multi-dimensional sets recognizable in all abstract numeration systems.

[BibT_eX]

[DOI]

Emilie Charlier

Anne Lacroix

RAIRO Theor. Informatics Appl., 2012

The Computational Complexity of Universality Problems for Prefixes, Suffixes, Factors, and Subwords of Regular Languages.

[BibT_eX]

[DOI]

Zhi Xu

Fundam. Informaticae, 2012

Syntactic Complexity of Ultimately Periodic Sets of Integers and Application to a Decision Procedure.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

Shuffling and Unshuffling.

[BibT_eX]

[DOI]

Dane Henshall

Bull. EATCS, 2012

2011

The growth function of S-recognizable sets.

[BibT_eX]

[DOI]

Emilie Charlier

Theor. Comput. Sci., 2011

A proof of Dejean's conjecture.

[BibT_eX]

[DOI]

Math. Comput., 2011

Inverse star, borders, and palstars.

[BibT_eX]

[DOI]

Ming-wei Wang

Inf. Process. Lett., 2011

The Minimal Automaton Recognizing mN in a Linear Numeration System.

[BibT_eX]

[DOI]

Integers, 2011

Shuffling and Unshuffling

[BibT_eX]

[DOI]

CoRR, 2011

Fife's Theorem for (7/3)-Powers

[BibT_eX]

[DOI]

Arseny M. Shur

Proceedings of the Proceedings 8th International Conference Words 2011, 2011

Further Applications of a Power Series Method for Pattern Avoidance.

[BibT_eX]

[DOI]

Electron. J. Comb., 2011

Recurrent words with constant Abelian complexity.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2011

Abstract Numeration Systems.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2011

On Highly Repetitive and Power Free Words.

[BibT_eX]

[DOI]

Elise Vaslet

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

Abelian Primitive Words.

[BibT_eX]

[DOI]

Michael Domaratzki

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

Enumeration and Decidable Properties of Automatic Sequences.

[BibT_eX]

[DOI]

Emilie Charlier

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010

Infinite words containing squares at every position.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2010

Detecting patterns in finite regular and context-free languages.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2010

Cubefree words with many squares.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2010

State Complexity of Testing Divisibility

[BibT_eX]

[DOI]

Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

2009

State complexity of unique rational operations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Decimations of languages and state complexity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

On NFAs where all states are final, initial, or both.

[BibT_eX]

[DOI]

Jui-Yi Kao

Theor. Comput. Sci., 2009

Dejean's conjecture holds for n>=30.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Periodicity, repetitions, and orbits of an automatic sequence.

[BibT_eX]

[DOI]

Jean-Paul Allouche

Theor. Comput. Sci., 2009

Dejean's conjecture holds for $\sf {N\ge 27}$.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2009

Detecting palindromes, patterns and borders in regular languages.

[BibT_eX]

[DOI]

Inf. Comput., 2009

There are k-uniform cubefree binary morphisms for all k>=0.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Automata and Reduced Words in the Free Group

[BibT_eX]

[DOI]

CoRR, 2009

Dejean's conjecture holds for n>=27.

[BibT_eX]

[DOI]

CoRR, 2009

On the Complexity of Deciding Avoidability of Sets of Partial Words.

[BibT_eX]

[DOI]

Brandon Blakeley

Francine Blanchet-Sadri

Josh Gunter

Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2008

Words avoiding repetitions in arithmetic progressions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Avoiding Approximate Squares.

[BibT_eX]

[DOI]

Pascal Ochem

Int. J. Found. Comput. Sci., 2008

Avoiding Sufficiently Large Binary Patterns.

[BibT_eX]

Bull. EATCS, 2008

On NFAs Where All States are Final, Initial, or Both

[BibT_eX]

[DOI]

CoRR, 2008

For each α > 2 there is an Infinite Binary Word with Critical Exponent α.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

Finite Automata, Palindromes, Powers, and Patterns.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2008

Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 12th International Conference, 2008

2007

On the context-freeness of the set of words containing overlaps.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

Finding the growth rate of a regular language in polynomial time

[BibT_eX]

[DOI]

Dalia Krieger

CoRR, 2007

Finite automata, palindromes, patterns, and borders

[BibT_eX]

[DOI]

CoRR, 2007

Avoiding Approximate Squares.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006

Squares and overlaps in the Thue-Morse sequence and some variants.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2006

The state complexity of L2 and Lk.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Binary Words Containing Infinitely Many Overlaps.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

2005

Avoiding large squares in infinite binary words.

[BibT_eX]

[DOI]

Ming-wei Wang

Theor. Comput. Sci., 2005

2004

Words Avoiding 7/3-Powers and the Thue-Morse Morphism.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 2004

2003

Cubefree binary words avoiding long squares

[BibT_eX]

[DOI]