Growth rates of power-free languages

DOI10.3103/S1066369X09090096zbMath1192.68424MaRDI QIDQ1037095

Arseny M. Shur

Publication date: 13 November 2009

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

zbMATH Keywords

growth ratecombinatorial complexityregular languagespower-free languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Growth of power-free languages: numerical and asymptotic bounds ⋮ Two-Sided Bounds for the Growth Rates of Power-Free Languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automata and forbidden words
• Polynomial versus exponential growth in repetition-free binary words
• Repetition-free words
• Enumeration of irreducible binary words
• Uniformly growing k-th power-free homomorphisms
• On the entropy and letter frequencies of ternary square-free words
• The number of binary cube-free words of length up to 47 and their numerical analysis

This page was built for publication: Growth rates of power-free languages