f-smooth words are precisely the factors of smooth words, with complexity growing as Θ(n^{log(a+b)/log((a+b)/2)}) proven for even alphabets, lower bound for all binary, and tighter upper bound for odd alphabets.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The complexity of finite smooth words over binary alphabets
f-smooth words are precisely the factors of smooth words, with complexity growing as Θ(n^{log(a+b)/log((a+b)/2)}) proven for even alphabets, lower bound for all binary, and tighter upper bound for odd alphabets.