James D. Currie

CoRR, September, 2025

Words with factor somplexity 2n+1 and minimal critical exponent.

[BibT_eX]

[DOI]

CoRR, July, 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

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

[BibT_eX]

[DOI]

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

The Repetition Threshold for Ternary Rich Words.

[BibT_eX]

[DOI]

Jarkko Peltomäki

Electron. J. Comb., 2025

Complement Avoidance in Binary Words.

[BibT_eX]

[DOI]

Electron. J. Comb., 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

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

The analogue of overlap-freeness for the period-doubling sequence.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Complement Avoidance in Binary Words.

[BibT_eX]

[DOI]

CoRR, 2022

2021

The undirected repetition threshold and undirected pattern avoidance.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101.

[BibT_eX]

[DOI]

Jesse T. Johnson

Theor. Comput. Sci., 2021

2020

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

[BibT_eX]

[DOI]

J. Integer Seq., 2020

The repetition threshold for binary rich words.

[BibT_eX]

[DOI]

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

2019

Some further results on squarefree arithmetic progressions in infinite words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Finite Test Sets for Morphisms That Are Squarefree on Some of Thue's Squarefree Ternary Words.

[BibT_eX]

[DOI]

J. Integer Seq., 2019

Finite test sets for morphisms which are square-free on some of Thue's square-free ternary 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

The Undirected Repetition Threshold.

[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

Unary patterns under permutations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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

2016

Growth rate of binary words avoiding xxxR.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Avoidability Index for Binary Patterns with Reversal.

[BibT_eX]

[DOI]

Philip Lafrance

Electron. J. Comb., 2016

A Ternary Square-free Sequence Avoiding Factors Equivalent to $abcacba$.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

2015

Binary Words Avoiding x xR x and Strongly Unimodal Sequences.

[BibT_eX]

[DOI]

J. Integer Seq., 2015

Binary words avoiding xx^Rx and strongly unimodal sequences.

[BibT_eX]

[DOI]

CoRR, 2015

Unary Patterns with Permutations.

[BibT_eX]

[DOI]

Florin Manea

Dirk Nowotka

Proceedings of the Developments in Language Theory - 19th International Conference, 2015

2014

The Least Self-Shuffle of the Thue-Morse Sequence.

[BibT_eX]

[DOI]

J. Integer Seq., 2014

Avoiding Three Consecutive Blocks of the Same Size and Same Sum.

[BibT_eX]

[DOI]

J. ACM, 2014

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

[BibT_eX]

[DOI]

Francine Blanchet-Sadri

Nathan Fox

Integers, 2014

Extremal words in morphic subshifts.

[BibT_eX]

[DOI]

Discret. Math., 2014

Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2014

Square-free Words with Square-free Self-shuffles.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

2013

Infinite ternary square-free words concatenated from permutations of a single word.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Suffix conjugates for a class of morphic subshifts.

[BibT_eX]

[DOI]

CoRR, 2013

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

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

Unary Patterns with involution.

[BibT_eX]

[DOI]

Bastian Bischoff

Dirk Nowotka

Int. J. Found. Comput. Sci., 2012

2011

Lexicographically least words in the orbit closure of the Rudin-Shapiro word.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

A proof of Dejean's conjecture.

[BibT_eX]

[DOI]

Math. Comput., 2011

Pattern avoidance with involution

[BibT_eX]

[DOI]

CoRR, 2011

Recurrent words with constant Abelian complexity.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2011

2010

Infinite words containing squares at every position.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2010

Cubefree words with many squares.

[BibT_eX]

[DOI]

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

2009

Dejean's conjecture holds for n>=30.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

A cyclic binary morphism avoiding Abelian fourth powers.

[BibT_eX]

[DOI]

Ali Aberkane

Theor. Comput. Sci., 2009

Least Periods of Factors of Infinite Words.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2009

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

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2009

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

The lexicographically least word in the orbit closure of the Rudin-Shapiro word

[BibT_eX]

[DOI]

CoRR, 2009

Dejean's conjecture holds for n>=27.

[BibT_eX]

[DOI]

CoRR, 2009

2008

Long binary patterns are Abelian 2-avoidable.

[BibT_eX]

[DOI]

Terry I. Visentin

Theor. Comput. Sci., 2008

Palindrome positions in ternary square-free words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

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

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

2007

Dejean's conjecture and Sturmian words.

[BibT_eX]

[DOI]

Morteza Mohammad Noori

Eur. J. Comb., 2007

On Abelian 2-avoidable binary patterns.

[BibT_eX]

[DOI]

Terry I. Visentin

Acta Informatica, 2007

2006

Binary Words Containing Infinitely Many Overlaps.

[BibT_eX]

[DOI]

Jeffrey O. Shallit

Electron. J. Comb., 2006

2005

Pattern avoidance: themes and variations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

The Thue-Morse word contains circular 5/2+ power free words of every length.

[BibT_eX]

[DOI]

Ali Aberkane

Theor. Comput. Sci., 2005

2004

The number of binary words avoiding abelian fourth powers grows exponentially.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

There Exist Binary Circular 5/2+ Power Free Words of Every Length.

[BibT_eX]

[DOI]

Ali Aberkane

Electron. J. Comb., 2004

2003

The set of k-power free words over sigma is empty or perfect, .

[BibT_eX]

[DOI]

Robert O. Shelton

Eur. J. Comb., 2003

The Fixing Block Method in Combinatorics on Words.

[BibT_eX]

[DOI]

Cameron W. Pierce

Comb., 2003

A word on 7 letters which is non-repetitive up to mod 5.

[BibT_eX]

[DOI]

Erica Moodie

Acta Informatica, 2003

What Is the Abelian Analogue of Dejean's Conjecture?

[BibT_eX]

Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

2002

Counting Endomorphisms of Crown-like Orders.

[BibT_eX]

[DOI]

Terry I. Visentin

Order, 2002

No iterated morphism generates any Arshon sequence of odd order.

[BibT_eX]

[DOI]

Discret. Math., 2002

Non-Repetitive Tilings.

[BibT_eX]

[DOI]

Jamie Simpson

Electron. J. Comb., 2002

There Are Ternary Circular Square-Free Words of Length n for n >= 18.

[BibT_eX]

[DOI]

Electron. J. Comb., 2002

Circular Words Avoiding Patterns.

[BibT_eX]

[DOI]

D. Sean Fitzpatrick

Proceedings of the Developments in Language Theory, 6th International Conference, 2002

1999

Separating Words with Small Grammars.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 1999

Words Strongly Avoiding Fractional Powers.

[BibT_eX]

[DOI]

Julien Cassaigne

Eur. J. Comb., 1999

1998

Extremal Infinite Overlap-Free Binary Words.

[BibT_eX]

[DOI]

Jean-Paul Allouche

Jeffrey O. Shallit

Electron. J. Comb., 1998

1996

Non-Repetitive Words: Ages and Essences.

[BibT_eX]

[DOI]

Comb., 1996

1995

On the structure and extendibility of k-power free words.

[BibT_eX]

[DOI]

Eur. J. Comb., 1995

A Note on Antichains of Words.

[BibT_eX]

[DOI]

Electron. J. Comb., 1995

Cantor Sets and Dejean's Conjecture.

[BibT_eX]

Robert O. Shelton

Proceedings of the Developments in Language Theory II, 1995

1992

Connectivity of distance graphs.

[BibT_eX]

[DOI]

Discret. Math., 1992

1991

Which graphs allow infinite nonrepetitive walks?

[BibT_eX]

[DOI]

Discret. Math., 1991

1987

Non-repetitive walks in graphs and digraphs.

[BibT_eX]

[DOI]