AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY

DOI10.1142/S0129054111008489zbMath1223.68089arXiv1005.2514OpenAlexW2119013637MaRDI QIDQ3016224

Gwenaël Richomme, Kalle Saari, Julien Cassaigne, Luca Q. Zamboni

Publication date: 14 July 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1005.2514

zbMATH Keywords

abelian poweravoidability in wordsabelian complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (20)

Abelian powers and repetitions in Sturmian words ⋮ Abelian Repetitions in Sturmian Words ⋮ On abelian versions of critical factorization theorem ⋮ Avoiding Three Consecutive Blocks of the Same Size and Same Sum ⋮ Fast algorithms for abelian periods in words and greatest common divisor queries ⋮ Binomial complexities and Parikh-collinear morphisms ⋮ On a generalization of abelian equivalence and complexity of infinite words ⋮ The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group ⋮ Abelian combinatorics on words: a survey ⋮ Automaticity and Parikh-Collinear Morphisms ⋮ On the 2-binomial complexity of the generalized Thue-Morse words ⋮ Characterizations of families of morphisms and words via binomial complexities ⋮ Abelian closures of infinite binary words ⋮ Weak abelian periodicity of infinite words ⋮ Relations on words ⋮ Abelian antipowers in infinite words ⋮ IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS ⋮ Templates for the \(k\)-binomial complexity of the Tribonacci word ⋮ Abelian Complexity and Frequencies of Letters in Infinite Words ⋮ On the Lie complexity of Sturmian words

Cites Work

• Balance and abelian complexity of the Tribonacci word
• Strongly non-repetitive sequences and progression-free sets
• On uniformly repetitive semigroups
• A characterization of substitutive sequences using return words
• On nonrepetitive sequences
• Balances for fixed points of primitive substitutions.
• Cobham-Semenov theorem and \(\mathbb N^d\)-subshifts
• Balances and Abelian Complexity of a Certain Class of Infinite Ternary Words
• A Second Course in Formal Languages and Automata Theory
• Symbolic Dynamics II. Sturmian Trajectories

This page was built for publication: AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY