Nie jesteś zalogowany |
Playing Safe
- Prelegent(ci)
- Nathanael Fijalkow
- Afiliacja
- Uniwersytet Warszawski
- Termin
- 1 października 2014 14:15
- Pokój
- p. 5870
- Seminarium
- Seminarium „Teoria automatów”
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.
