Growth of power-free languages: numerical and asymptotic bounds

DOI10.1134/S1064562410030191zbMath1211.68301OpenAlexW2085984546MaRDI QIDQ610578

Arseny M. Shur

Publication date: 8 December 2010

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562410030191

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05) Formal languages and automata (68Q45)

Cites Work

• Growth rates of power-free languages
• Uniformly growing k-th power-free homomorphisms
• Growth of repetition-free words -- a review
• Sur un théorème de Thue
• Two-Sided Bounds for the Growth Rates of Power-Free Languages

This page was built for publication: Growth of power-free languages: numerical and asymptotic bounds