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

被引：0

作者：

Shur, Arseny M. ^{[1
]}

机构：

[1] Ural State Univ, Ekaterinburg, Russia

来源：

DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS | 2009年 / 5583卷

关键词：

COMPLEXITY; WORDS;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：466 / 477

页数：12

共 50 条

[1] Growth Rates of Power-Free Languages
Shur, A. M.
[J]. RUSSIAN MATHEMATICS, 2009, 53 (09) : 73 - 78
[2] Growth rates of power-free languages
A. M. Shur
[J]. Russian Mathematics, 2009, 53 (9) : 73 - 78
[3] Growth rates of complexity of power-free languages
Shur, Arseny M.
[J]. THEORETICAL COMPUTER SCIENCE, 2010, 411 (34-36) : 3209 - 3223
[4] Growth of Power-Free Languages: Numerical and Asymptotic Bounds
Shur, A. M.
[J]. DOKLADY MATHEMATICS, 2010, 81 (03) : 406 - 409
[5] Growth of power-free languages: Numerical and asymptotic bounds
A. M. Shur
[J]. Doklady Mathematics, 2010, 81 : 406 - 409
[6] Growth properties of power-free languages
Shur, Arseny M.
[J]. COMPUTER SCIENCE REVIEW, 2012, 6 (5-6) : 187 - 208
[7] Lower-Bounds on the Growth of Power-Free Languages Over Large Alphabets
Matthieu Rosenfeld
[J]. Theory of Computing Systems, 2021, 65 : 1110 - 1116
[8] Lower-Bounds on the Growth of Power-Free Languages Over Large Alphabets
Rosenfeld, Matthieu
[J]. THEORY OF COMPUTING SYSTEMS, 2021, 65 (07) : 1110 - 1116
[9] Growth of Power-Free Languages over Large Alphabets
Arseny M. Shur
[J]. Theory of Computing Systems, 2014, 54 : 224 - 243
[10] Growth of Power-Free Languages over Large Alphabets
Shur, Arseny M.
[J]. THEORY OF COMPUTING SYSTEMS, 2014, 54 (02) : 224 - 243

← 1 2 3 4 5 →