University of Cambridge > Talks.cam > Computer Laboratory Wednesday Seminars > From deterministic finite automata to infinite games

From deterministic finite automata to infinite games

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Stephen Clark.

This is an introduction to the field of infinite games, which is relevant to computer science due to its deep links to the automata theory, and its application to the verification of computer systems. Infinite games (e.g. parity games) are played by two antagonistic players, who make moves on a given graph; the duration of the play is infinite, and the winner depends on the properties of the infinite path resulting from the players’ movements. I will start with the well known finite automata on finite words, and proceed to automata on infinite structures, and infinite games.

This talk is part of the Computer Laboratory Wednesday Seminars series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2017 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity