Growth of Power-Free Languages over Large Alphabets › Research Explorer

DOI

https://doi.org/10.1007/s00224-013-9512-x
Final published version

Arseny M. Shur

Original language	English
Pages (from-to)	224-243
Number of pages	20
Journal	Theory of Computing Systems
Volume	54
Issue number	2
DOIs	https://doi.org/10.1007/s00224-013-9512-x
Publication status	Published - Feb 2014

Research areas

Formal languages, Power-free languages, Finite automata, Growth rate, DEJEANS CONJECTURE, COMPLEXITY, WORDS, RATES

ASJC Scopus subject areas

Computational Theory and Mathematics
Theoretical Computer Science

ID: 335938