Lower Bounds for the Length of Reset Words in Eulerian Automata.
Vladimir V. GusevPublished in: RP (2011)
Keyphrases
- lower bound
- upper bound
- finite alphabet
- branch and bound
- branch and bound algorithm
- cellular automata
- lower and upper bounds
- worst case
- objective function
- n gram
- np hard
- keywords
- text documents
- word sense disambiguation
- vc dimension
- quadratic assignment problem
- image registration
- learning algorithm
- optimal solution
- regular expressions
- probabilistic automata
- reinforcement learning