The abelian complexity of infinite words and the Frobenius problem

zbMath1477.68252arXiv1907.08247MaRDI QIDQ4987432

Ian Kaye, Rampersad Narad

Publication date: 3 May 2021

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

zbMATH Keywords

Frobenius probleminfinite wordbalanced wordabelian complexitymorphic wordpaperfolding word

Mathematics Subject Classification ID

Combinatorics on words (68R15) The Frobenius problem (11D07)

Related Items (1)

Minimal Complexities for Infinite Words Written with d Letters

Cites Work

• Unnamed Item
• Aperiodic pseudorandom number generators based on infinite words
• On the Frobenius problem for Beatty sequences
• Well-balanced sequences
• The Frobenius problem for homomorphic embeddings of languages into the integers
• Balanced words
• The abelian complexity of the paperfolding word
• Generalized Beatty sequences and complementary triples
• On the asymptotic abelian complexity of morphic words
• Abelian complexity of minimal subshifts
• On Abelian and Additive Complexity in Infinite Words
• Sequences with minimal block growth

This page was built for publication: The abelian complexity of infinite words and the Frobenius problem