Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique.
Qiqi YanPublished in: Log. Methods Comput. Sci. (2008)
Keyphrases
- lower bound
- probabilistic automata
- cellular automata
- upper bound
- tree automata
- finite automata
- finite state machines
- finite state
- np hard
- lattice gas
- neural network
- worst case
- relational databases
- learning algorithm
- branch and bound
- branch and bound algorithm
- data model
- optimal solution
- optimal cost
- objective function