Alternating tree Automata and Parity games Based on
Alternating tree Automata and Parity games Based on chapter 9 Logic and infinite games, edited by Gradel, Thomas and Wilke, LNCS 2500. Lior Schneider, 17. 5. 17
topics Defining Alternating tree automata and its behavior Parity games equality to Ata The word problem complexity The complementation problem complexity The Emptiness problem complexity
perliminaries
perliminaries
perliminaries
perliminaries
Alternating Tree Automata behavior stops
successful instance
Formalization problem
Parity game conversion
Parity game conversion
Examples
Examples
Examples
Current disadvantages
Alternative Formal Definition for the Arena
Alternative Formal Definition for the Arena
Alternative Formal Definition for the Arena
Complex Transition Conditions
Complex Transition Conditions p
The Word problem
The Word problem
The Word problem
The Word problem
The Word problem
The Word problem
The Word problem
Complementation problem
Complementation problem
Complementation problem
The Emptiness Problem On this section: The Emptiness Problem complexity analysis
The Emptiness Problem
The Emptiness Problem
The Emptiness Problem
The Emptiness Problem
The Emptiness Problem
The Emptiness Problem
The Emptiness Problem non-deterministic parity ω-automaton
done
- Slides: 39