Two-Sided Bounds for the Growth Rates of Power-Free Languages / Shur Arseny M. // . - 2009. - V. 5583, l. . - P. 466-477.

ISSN/EISSN:

0302-9743 / нет данных

Type:

Proceedings Paper

Abstract:

The growth properties of power-free languages over finite alphabets axe studied. A method to obtain sharp two-sided bounds of the growth rate of beta-power-free languages for arbitrary rational number beta >= 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.

Author keywords:

REPETITION-FREE WORDS; COMPLEXITY

DOI:

нет данных

Web of Science ID:

ISI:000270353000038

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

—

Другие поля

Поле	Значение
Editor	Diekert, V and Nowotka, D
Booktitle	DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS
Series	Lecture Notes in Computer Science
Note	13th International Conference on Developments in Language Theory, Stuttgart, GERMANY, JUN 30-JUL 03, 2009
Organization	German Res Fdn; Univ Stuttgart; Assoc Informat Forum Stuttgart
Publisher	SPRINGER-VERLAG BERLIN
Address	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
Language	English
ISBN	978-3-642-02736-9
Keywords-Plus	REPETITION-FREE WORDS; COMPLEXITY
Research-Areas	Computer Science
Web-of-Science-Categories	Computer Science, Theory \& Methods
Number-of-Cited-References	17
Doc-Delivery-Number	BLK32