Abstract
We propose a new fast algorithm for calculating the growth rate of complexity for regular languages. Based on this algorithm, we develop an efficient universal method for estimating the upper bound of the growth rates for power-free languages. Through extensive computer-assisted studies we sufficiently improve all known upper bounds for growth rates of such languages, obtain a lot of new bounds, and discover some general regularities.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Thue, “Über Unendliche Zeichenreihen,” Kra. Vidensk. Selsk. Skrifter. I.Mat., Nat. Kl. 7, 1–22 (1906).
J. Berstel and J. Karhumäki, “Combinatorics on Words: A Tutorial,” Bull. Eur. Assoc. Theor. Comput. Sci., No. 79, 178–228 (2003).
F.-J. Brandenburg, “Uniformly Growing k th Power Free Homomorphisms,” Theor. Comput. Sci. 23(1), 69–82 (1983).
A. Restivo and S. Salemi, “Overlap-Free Words on Two Symbols,” Lect. Notes Comp. Sci. 192, 198–206 (1985).
A. Edlin, The Number of Binary Cube-Free Words of Length up to 47 and Their Numerical Analysis,” J. Diff. Eq. and Appl. 5(4–5), 153–154 (1999).
J. Karhumäki and J. Shallit, “Polynomial Versus Exponential Growth in Repetition-Free Binary Words,” J. Combin. Theory. Ser. A. 105(2), 335–347 (2004).
Y. Kobayashi, “Enumeration of Irreducible Binary Words,” Discr. Appl. Math. 20(3), 221–232 (1988).
R. Kolpakov, “On the Number of Repetition-Free Words,” Electron. Proc. of Workshop on Words and Automata WOWA’06, St.-Petersburg, 2006, #6 (2006).
P. Ochem and T. Reix, “Upper Bound on the Number of Ternary Square-FreeWords,” in Electron. Proc. of Workshop on Words and Automata WOWA’06, St.-Petersburg, 2006, #8 (2006).
C. Richard and U. Grimm, “On the Entropy and Letter Frequencies of Ternary Square-Free Words,” Electronic J. Combinatorics 11(1), Research paper R14 (2004).
Y. Kobayashi, “Repetition-Free Words,” Theor. Comp. Sci. 44(2), 175–197 (1986).
A.M. Shur, “Growth Rates of Complexity of Power-Free Languages,” Theor. Comp. Sci., 2008 (in press).
D. M. Cvetković, M. Doob, and H. Sachs, Spectra of Graphs. Theory and Applications (Johann Ambrosius Barth, Heidelberg, 1995; Naukova Dumka, Kiev, 1984).
F. R. Gantmacher, The Theory ofMatrices (Nauka, Moscow, 1988; AmericanMathematical Society, 2000).
M. Crochemore, F. Mignosi, and A. Restivo, “Automata and Forbidden Words,” Inform. Proc. Lett. 67(3), 111–117 (1998).
C. D. Godsil, Algebraic Combinatorics (Chapman and Hall, New York, 1993).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A.M. Shur, 2009, published in Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2009, No. 9, pp. 82–88.
Submitted by L. N. Shevrin
About this article
Cite this article
Shur, A.M. Growth rates of power-free languages. Russ Math. 53, 73–78 (2009). https://doi.org/10.3103/S1066369X09090096
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S1066369X09090096