Language-Emptiness Checking of Alternating Tree Automata Using Symbolic Reachability Analysis.
Kairong QianAlbert NymeyerPublished in: Electron. Notes Theor. Comput. Sci. (2006)
Keyphrases
- tree automata
- reachability analysis
- tree languages
- finite state
- markov decision processes
- model checking
- regular expressions
- finite automata
- monadic second order logic
- context free
- language learning
- timed automata
- natural language
- finite automaton
- syntactic pattern recognition
- incremental algorithms
- context sensitive
- grammatical inference
- context free grammars
- context dependent
- optimal policy
- production rules
- knowledge representation
- high level