On Abelian and Additive Complexity in Infinite Words
From MaRDI portal
Publication:4650104
DOI10.1515/integers-2012-0005zbMath1253.68269arXiv1107.4654MaRDI QIDQ4650104
Julian Sahasrabudhe, Veselin Jungić, Hayri Ardal, Thomas C. Brown
Publication date: 23 November 2012
Published in: Integers (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.4654
68R15: Combinatorics on words
Related Items
The abelian complexity of infinite words and the Frobenius problem, The Frobenius problem for homomorphic embeddings of languages into the integers, On the additive complexity of a Thue-Morse-like sequence, Permutations destroying arithmetic structure