Numerical values of the growth rates of power-free languages

preprint2012arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.