On Abelian repetition threshold

DOI10.1051/ita/2011127zbMath1279.68240OpenAlexW2159956116MaRDI QIDQ2911433

A. V. Samsonov, Arseny M. Shur

Publication date: 31 August 2012

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/222002

zbMATH Keywords

formal languagesrepetition thresholdabelian powersavoidable repetitions

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algebraic theory of languages and automata (68Q70)

Related Items (13)

Abelian powers and repetitions in Sturmian words ⋮ Branching frequency and Markov entropy of repetition-free languages ⋮ Abelian Repetitions in Sturmian Words ⋮ The undirected repetition threshold and undirected pattern avoidance ⋮ On minimal critical exponent of balanced sequences ⋮ Abelian periods of factors of Sturmian words ⋮ Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture ⋮ Abelian combinatorics on words: a survey ⋮ Growth properties of power-free languages ⋮ Avoiding abelian powers cyclically ⋮ Weak abelian periodicity of infinite words ⋮ Unnamed Item ⋮ Abelian repetition threshold revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Last cases of Dejean's conjecture
• The number of binary words avoiding Abelian fourth powers grows exponentially
• A powerful abelian square-free substitution over 4 letters
• Growth rates of complexity of power-free languages
• Strongly non-repetitive sequences and progression-free sets
• On the number of Abelian square-free words on four letters
• Uniformly growing k-th power-free homomorphisms
• On Dejean's conjecture over large alphabets
• Sur un théorème de Thue
• A proof of Dejean’s conjecture
• Comparing Complexity Functions of a Language and Its Extendable Part

This page was built for publication: On Abelian repetition threshold