Growth of Power-Free Languages: Numerical and Asymptotic Bounds / Shur A. M. // DOKLADY MATHEMATICS. - 2010. - V. 81, l. 3. - P. 406-409.

ISSN/EISSN:

1064-5624 / нет данных

Type:

Article

Abstract:

We consider power-free languages over finite alphabets. That is, the words which are powers with the exponent greater than a given constant cannot be factors of words in these languages. We give numerical bounds of the exponential growth rate for a wide range of such languages. These bounds are obtained using the algorithms proposed by the author. On the basis of these bounds we suggest the asymptotic behaviour of the growth rate as a function of the exponent and the size of the alphabet, and give some theorems about this behaviour.

Author keywords:

FREE WORDS

DOI:

10.1134/S1064562410030191

Web of Science ID:

ISI:000283712100019

Соавторы в МНС:

—

Другие поля

Поле	Значение
Month	JUN
Publisher	MAIK NAUKA/INTERPERIODICA/SPRINGER
Address	233 SPRING ST, NEW YORK, NY 10013-1578 USA
Language	English
Keywords-Plus	FREE WORDS
Research-Areas	Mathematics
Web-of-Science-Categories	Mathematics
Author-Email	Arseny.Shur@usu.ru
Number-of-Cited-References	10
Journal-ISO	Dokl. Math.
Doc-Delivery-Number	674CU