Lower Bounds for the Length of Reset Words in Eulerian Automata.
Vladimir V. GusevPublished in: Int. J. Found. Comput. Sci. (2013)
Keyphrases
- lower bound
- upper bound
- n gram
- finite alphabet
- word sense disambiguation
- objective function
- branch and bound
- np hard
- branch and bound algorithm
- finite automata
- related words
- worst case
- cellular automata
- finite state
- vc dimension
- quadratic assignment problem
- english words
- partial differential equations
- optimal solution
- regular expressions
- finite state machines
- probabilistic automata
- keywords