Factor Complexity of Infinite Words Associated with Non-Simple Parry Numbers
From MaRDI portal
Publication:3182865
DOI10.1515/INTEG.2009.025zbMath1193.68201arXiv0812.0164MaRDI QIDQ3182865
Publication date: 16 October 2009
Published in: INTEG (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0812.0164
Combinatorics on words (68R15) PV-numbers and generalizations; other special algebraic numbers; Mahler measure (11R06)
Related Items
On the structure of (−β)-integers, Balances and Abelian Complexity of a Certain Class of Infinite Ternary Words, Complexity of Leading Digit Sequences