A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata.
Thomas ColcombetKonrad ZdanowskiPublished in: ICALP (2) (2009)
Keyphrases
- lower bound
- upper bound
- branch and bound
- lower and upper bounds
- worst case
- training data
- branch and bound algorithm
- cellular automata
- np hard
- finite automata
- upper and lower bounds
- objective function
- manual labeling
- finite state
- optimal solution
- probabilistic automata
- finite state machines
- supervised learning
- linear programming relaxation
- machine learning
- competitive ratio
- turing machine
- finite state automata
- labeling process
- hidden markov models