Abelian complexity of infinite words associated with quadratic Parry numbers

DOI10.1016/j.tcs.2011.08.016zbMath1246.68174arXiv1101.1490MaRDI QIDQ653315

Karel Břinda, L'ubomíra Balková, Ondřej Turek

Publication date: 9 January 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

abelian complexity; binary infinite word; quadratic Parry number

Mathematics Subject Classification ID

68R15: Combinatorics on words

Related Items

Minimal Complexities for Infinite Words Written with d Letters, Abelian properties of Parry words, On the \(k\)-abelian complexity of the Cantor sequence, On the additive complexity of a Thue-Morse-like sequence, On the asymptotic abelian complexity of morphic words, On the abelian complexity of the Rudin-Shapiro sequence, On the abelian complexity of generalized Thue-Morse sequences, Computing abelian complexity of binary uniform morphic words

Cites Work

• Unnamed Item
• Unnamed Item
• 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 and Abelian Complexity of a Certain Class of Infinite Ternary Words
• Abelian complexity of minimal subshifts
• 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