Growth of power-free languages over large alphabets

DOI10.1007/978-3-642-13182-0_35zbMATH Open1285.68091OpenAlexW1504191168MaRDI QIDQ3569760FDOQ3569760

Authors: Arseny M. Shur 

Publication date: 22 June 2010

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13182-0_35

Recommendations

• Growth of power-free languages over large alphabets
• Growth of power-free languages: numerical and asymptotic bounds
• Two-Sided Bounds for the Growth Rates of Power-Free Languages
• Growth properties of power-free languages
• Growth rates of power-free languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (9)

• Two-Sided Bounds for the Growth Rates of Power-Free Languages
• Computing the maximum exponent in a stream
• LANGUAGES WITH A FINITE ANTIDICTIONARY: SOME GROWTH QUESTIONS
• Growth of power-free languages: numerical and asymptotic bounds
• Growth properties of power-free languages
• Growth properties of power-free languages
• Growth rates of power-free languages
• Growth of power-free languages over large alphabets
• Generating square-free words efficiently

This page was built for publication: Growth of power-free languages over large alphabets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569760)