You are not logged in |
Playing Safe
- Speaker(s)
- Nathanael Fijalkow
- Affiliation
- Uniwersytet Warszawski
- Date
- Oct. 1, 2014, 2:15 p.m.
- Room
- room 5870
- Seminar
- Seminar Automata Theory
The general question we consider is to characterize the memory size of winning strategies in two-player games.
In this talk, I will show that for the special case of safety conditions (aka topologically closed conditions), the minimal number of memory states of a strategy ensuring a safety condition is given by the size of the maximal antichain of left quotients with respect to language inclusion.
In this talk, I will show that for the special case of safety conditions (aka topologically closed conditions), the minimal number of memory states of a strategy ensuring a safety condition is given by the size of the maximal antichain of left quotients with respect to language inclusion.
