Emptiness Of Alternating Tree Automata Using Games With Imperfect Information.
Nathanaël FijalkowSophie PinchinatOlivier SerrePublished in: FSTTCS (2013)
Keyphrases
- tree automata
- imperfect information
- finite automata
- regular expressions
- perfect information
- game theoretic
- opponent modeling
- game playing
- game tree search
- finite state
- tree languages
- grammatical inference
- game theory
- card game
- imperfect information games
- game tree
- context free grammars
- alternating time temporal logic
- nash equilibrium
- databases
- human players
- evaluation function
- video games
- markov decision processes
- monte carlo
- markov chain
- hidden markov models