Numerical values of the growth rates of power-free languages
classification
💻 cs.FL
math.CO
keywords
boundsgrowthlanguagespower-freealgorithmsauthordevelopedexponential
read the original abstract
We present upper and two-sided bounds of the exponential growth rate for a wide range of power-free languages. All bounds are obtained with the use of algorithms previously developed by the author.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.