Quasioptimal Bound for the Length of Reset Words for Regular Automata.

Published in: Acta Cybern. (1995)

Keyphrases

finite alphabet
upper bound
context free
lower bound
cellular automata
n gram
word sense disambiguation
regular languages
regular expressions
finite state
related words
english words
syntactic categories
worst case
language model
context sensitive
fixed length