Abelian closures of infinite binary words

DOI10.1016/j.jcta.2021.105524zbMath1484.68175arXiv2008.08125OpenAlexW3198818221MaRDI QIDQ2237936

Svetlana Puzynina, Markus A. Whiteland

Publication date: 28 October 2021

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

Sturmian wordsinfinite wordssubshiftsabelian equivalence

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (2)

Abelian combinatorics on words: a survey ⋮ Automaticity and Parikh-Collinear Morphisms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak abelian periodicity of infinite words
• Sturmian morphisms and Rauzy's rules
• A characterization of substitutive sequences using return words
• Sturmian words: structure, combinatorics, and their arithmetics
• Well-balanced sequences
• On abelian subshifts
• The abelian complexity of the paperfolding word
• Avoiding abelian powers cyclically
• Abelian properties of words
• Every nonnegative real number is an abelian critical exponent
• Abelian-square-rich words
• On the asymptotic abelian complexity of morphic words
• AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
• Abelian complexity of minimal subshifts
• Statistical mechanics of cellular automata
• Geometric realizations of substitutions
• Avoiding Two Consecutive Blocks of Same Size and Same Sum over $\mathbb{Z}^2$
• An Introduction to Symbolic Dynamics and Coding
• Abelian squares are avoidable on 4 letters
• Sequences with minimal block growth
• Abelian returns in Sturmian words

This page was built for publication: Abelian closures of infinite binary words