Abelian Complexity and Frequencies of Letters in Infinite Words

DOI10.1142/S0129054116500209zbMath1353.68221OpenAlexW2523966417MaRDI QIDQ2833546

Idrissa Kaboré, Julien Cassaigne

Publication date: 18 November 2016

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054116500209

zbMATH Keywords

infinite wordabelian complexityuniform recurrenceParikh vectorsuniform frequencies

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (2)

Minimal Complexities for Infinite Words Written with d Letters ⋮ On infinite prefix normal words

Cites Work

• Sequences with subword complexity \(2n\)
• The asymptotic distribution of elements in automatic sequences
• Balances for fixed points of primitive substitutions.
• AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
• Abelian complexity of minimal subshifts
• Complexité des facteurs des mots infinis engendrés par morphismes itérés
• The Construction of Decimals Normal in the Scale of Ten

This page was built for publication: Abelian Complexity and Frequencies of Letters in Infinite Words