An Improved Lower Bound for the Complementation of Rabin Automata.
Yang CaiTing ZhangHaifeng LuoPublished in: LICS (2009)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- np hard
- branch and bound
- cellular automata
- lower and upper bounds
- worst case
- finite state
- objective function
- probabilistic automata
- regular expressions
- lattice gas
- sufficiently accurate
- lower bounding
- finite automata
- upper and lower bounds
- finite state machines
- polynomial approximation
- data structure
- optimal solution
- lagrangian relaxation
- linear programming relaxation
- finite state automata
- database