Lower Bounds for Synchronizing Word Lengths in Partial Automata.
Michiel de BondtHenk DonHans ZantemaPublished in: Int. J. Found. Comput. Sci. (2019)
Keyphrases
- lower bound
- upper bound
- objective function
- co occurrence
- cellular automata
- regular expressions
- np hard
- lower and upper bounds
- n gram
- branch and bound
- upper and lower bounds
- finite automata
- optimal solution
- branch and bound algorithm
- keywords
- word recognition
- vc dimension
- information retrieval
- max sat
- finite state machines
- online algorithms
- probabilistic automata