Two-Sided Bounds for the Growth Rates of Power-Free Languages

The growth properties of power-free languages over finite alphabets are studied. A method to obtain sharp two-sided bounds of the growth rate of β-power-free languages for arbitrary rational number β ? 2 is obtained. A table of the growth rates, calculated with the absolute error less than 10? 5 for different particular power-free languages, is presented.

[1]  Yuji Kobayashi,et al.  Repetition-Free Words , 1986, Theor. Comput. Sci..

[2]  Roman Kolpakov,et al.  On the number of repetition-free words , 2007 .

[3]  Antonio Restivo,et al.  Automata and Forbidden Words , 1998, Inf. Process. Lett..

[4]  Jean Berstel,et al.  Growth of repetition-free words -- a review , 2005, Theor. Comput. Sci..

[5]  Jason P. Bell,et al.  Exponential lower bounds for the number of words of uniform length avoiding a pattern , 2007, Inf. Comput..

[6]  Maurice Nivat,et al.  Automata on Infinite Words , 1985, Lecture Notes in Computer Science.

[7]  Arseny M. Shur.  Comparing Complexity Functions of a Language and Its Extendable Part , 2008, RAIRO Theor. Informatics Appl..

[8]  M. Lothaire.  Combinatorics on words: Bibliography , 1997 .

[9]  Franz-Josef Brandenburg,et al.  Uniformly Growing k-TH Power-Free Homomorphisms , 1988, Theor. Comput. Sci..

[10]  Arseny M. Shur,et al.  Growth rates of complexity of power-free languages , 2010, Theor. Comput. Sci..

[11]  F. Gantmacher,et al.  Applications of the theory of matrices , 1960 .

[12]  Antonio Restivo,et al.  Overlap-free words on two symbols , 1984, Automata on Infinite Words.

[13]  Arseny M. Shur,et al.  Combinatorial Complexity of Regular Languages , 2008, CSR.

[14]  Juhani Karhumäki,et al.  Combinatorics on words: a tutorial , 2003, Bull. EATCS.

[15]  Jeffrey Shallit,et al.  Polynomial versus exponential growth in repetition-free binary words , 2003, J. Comb. Theory, Ser. A.

[16]  Michael Doob,et al.  Spectra of graphs , 1980 .