Theoretical Computer Science
Enumeration of irreducible binary words
Discrete Applied Mathematics
Information Processing Letters
Polynomial versus exponential growth in repetition-free binary words
Journal of Combinatorial Theory Series A
On Dejean's conjecture over large alphabets
Theoretical Computer Science
Combinatorial complexity of regular languages
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
On the existence of minimal β-powers
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Growth properties of power-free languages
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Growth of power-free languages over large alphabets
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Growth of Power-Free Languages over Large Alphabets
Theory of Computing Systems
| Hi-index | 5.23 |
We present a new fast algorithm for calculating the growth rate of complexity for regular languages. Using this algorithm we develop a space and time efficient method to approximate growth rates of complexity of arbitrary power-free languages over finite alphabets. 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.