Numerical values of the growth rates of power-free languages

TL;DR

This paper provides bounds on the exponential growth rates of power-free languages using algorithms developed by the author, advancing understanding of their combinatorial properties.

Contribution

It introduces new upper and two-sided bounds for growth rates of power-free languages, utilizing previously developed algorithms.

Findings

Established upper bounds for growth rates.

Derived two-sided bounds for various power-free languages.

Applied algorithms to analyze combinatorial complexity.

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.