Characteristic properties of game graphs and strategy automata

Speaker

Namit Chaturvedi, I7
Title Characteristic properties of game graphs and strategy automata
When 09.12.2010, 15:00
Where Lecture Room Informatik 11
Abstract Regular languages can be extended to regular omega-languages through a number of methods. Given well known

characterizations of transition properties for minimal DFAs of regular languages, it is possible to conclude these properties for deterministic omega-automata. Further, from the games that these omega-automata induce we conclude the transition structures of their winning strategies.
Slides