Balances and Abelian Complexity of a Certain Class of Infinite Ternary Words
From MaRDI portal
Publication:3060201
DOI10.1051/ita/2010017zbMath1211.68303arXiv1003.1486OpenAlexW3099738031MaRDI QIDQ3060201
Publication date: 1 December 2010
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1003.1486
Related Items
On the \(k\)-abelian complexity of the Cantor sequence, Abelian complexity of infinite words associated with quadratic Parry numbers, Abelian properties of Parry words, Sturmian jungle (or garden?) on multiliteral alphabets, AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
Cites Work
- Unnamed Item
- Unnamed Item
- Recurrent words with constant abelian complexity
- Rotation encoding and self-similarity phenomenon
- Substitutions and \(\beta\) systems of numeration
- Balance and abelian complexity of the Tribonacci word
- Additive and multiplicative properties of point sets based on beta-integers.
- Balances for fixed points of primitive substitutions.
- Imbalances in Arnoux-Rauzy sequences
- Balance properties of multi-dimensional words
- Balanced words
- Abelian complexity of minimal subshifts
- Factor Complexity of Infinite Words Associated with Non-Simple Parry Numbers
- Can a Graph Be Both Continuous and Discontinuous?
- Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers
- Balance properties of the fixed point of the substitution associated to quadratic simple Pisot numbers
- Sequences with minimal block growth
- Symbolic Dynamics
- Symbolic Dynamics II. Sturmian Trajectories
