Simulating Alternating Tree Automata by Nondeterministic Automata: New Results and New Proofs of the Theorems of Rabin, McNaughton and Safra.
David E. MullerPaul E. SchuppPublished in: Theor. Comput. Sci. (1995)
Keyphrases
- tree automata
- finite automata
- finite automaton
- finite state
- sequent calculus
- cut elimination
- regular expressions
- proof search
- tree languages
- markov chain
- model checking
- grammatical inference
- inference rules
- theorem proving
- theorem prover
- markov decision processes
- syntactic pattern recognition
- natural deduction
- sufficient conditions
- linear logic
- hidden markov models
- database
- context free grammars
- optimal policy
- regular tree languages
- context free
- data management
- object oriented
- data model
- search space