Login / Signup
A note on constructing infinite binary words with polynomial subword complexity.
Francine Blanchet-Sadri
Bob Chen
Sinziana Munteanu
Published in:
RAIRO Theor. Informatics Appl. (2013)
Keyphrases
</>
n gram
vapnik chervonenkis dimension
spoken document retrieval
worst case
polynomial hierarchy
computational complexity
decision problems
neural network
language model
np complete
space complexity
non binary
multiword
related words