Lower Bounds for Synchronizing Word Lengths in Partial Automata.
Michiel de BondtHenk DonHans ZantemaPublished in: CoRR (2018)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- cellular automata
- n gram
- upper and lower bounds
- branch and bound
- co occurrence
- objective function
- worst case
- np hard
- lower and upper bounds
- word recognition
- keywords
- finite state machines
- finite state
- optimal cost
- finite automata
- probabilistic automata
- concept class
- word segmentation
- sentence level
- regular expressions
- word sense disambiguation
- optimal solution