Abelian complexity of infinite words associated with quadratic Parry numbers
From MaRDI portal
Publication:653315
DOI10.1016/J.TCS.2011.08.016zbMATH Open1246.68174arXiv1101.1490OpenAlexW1989836972MaRDI QIDQ653315FDOQ653315
Authors: L'ubomira Balková, Karel Břinda, Ondřej Turek 
Publication date: 9 January 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Abstract: We derive an explicit formula for the Abelian complexity of infinite words associated with quadratic Parry numbers.
Full work available at URL: https://arxiv.org/abs/1101.1490
Recommendations
- Palindromic complexity of infinite words associated with non-simple Parry numbers
- Abelian complexity and abelian co-decomposition
- Factor Complexity of Infinite Words Associated with Non-Simple Parry Numbers
- Abelian properties of Parry words
- Palindromic complexity of infinite words associated with simple Parry numbers
Cites Work
- Title not available (Why is that?)
- Balance and abelian complexity of the Tribonacci word
- Abelian complexity of minimal subshifts
- Sequences with minimal block growth
- Balances and Abelian complexity of a certain class of infinite ternary words
- 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
- Substitutions and \(\beta\) systems of numeration
- Additive and multiplicative properties of point sets based on beta-integers.
- Infinite special branches in words associated with beta-expansions
Cited In (16)
- On the asymptotic abelian complexity of morphic words
- On the additive complexity of a Thue-Morse-like sequence
- Computing abelian complexity of binary uniform morphic words
- On the abelian complexity of generalized Thue-Morse sequences
- Parikh q-Matrices and q-Ambiguous Words
- On the abelian complexity of the Rudin-Shapiro sequence
- Complexity for infinite words associated with quadratic non-simple Parry numbers
- Palindromic complexity of infinite words associated with simple Parry numbers
- Minimal Complexities for Infinite Words Written with d Letters
- Palindromic complexity of infinite words associated with non-simple Parry numbers
- Abelian properties of Parry words
- Another generalization of abelian equivalence: binomial complexity of infinite words
- On the \(k\)-abelian complexity of the Cantor sequence
- Critical exponent of infinite words coding beta-integers associated with non-simple Parry numbers
- Factor Complexity of Infinite Words Associated with Non-Simple Parry Numbers
- Abelian complexity and abelian co-decomposition
This page was built for publication: Abelian complexity of infinite words associated with quadratic Parry numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q653315)
