From deterministic finite automata to infinite games

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

• Eryk Kopczynski
• Wednesday 11 May 2011, 14:15-15:15
• Lecture Theatre 1, Computer Laboratory.

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 Wednesday Seminars - Department of Computer Science and Technology series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Chris Davis' list
• Department of Computer Science and Technology talks and seminars
• Graduate-Seminars
• Guy Emerson's list
• Interested Talks
• Lecture Theatre 1, Computer Laboratory
• School of Technology
• Trust & Technology Initiative - interesting events
• Wednesday Seminars - Department of Computer Science and Technology
• bld31
• computer science
• se393's list

Note that ex-directory lists are not shown.