Complementing Deterministic Büchi Automata in Polynomial Time.
Robert P. KurshanPublished in: J. Comput. Syst. Sci. (1987)
Keyphrases
- turing machine
- deterministic automata
- finite automata
- finite state automaton
- deterministic domains
- probabilistic automata
- special case
- tree automata
- decomposable negation normal form
- black box
- regular expressions
- computational complexity
- deterministic finite automata
- randomized algorithm
- tree languages
- randomized algorithms
- information gain
- finite automaton
- cellular automata
- worst case
- data model