Sign in
Infinite Words with Linear Subword Complexity.
Filippo Mignosi
Published in:
Theor. Comput. Sci. (1989)
Keyphrases
</>
n gram
spoken document retrieval
computational complexity
lower bound
worst case
closed form
infinite dimensional
linear complexity
out of vocabulary
language model
space complexity