BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:From deterministic finite automata to infinite games - Eryk Kopczy
 nski
DTSTART:20110511T131500Z
DTEND:20110511T141500Z
UID:TALK31010@talks.cam.ac.uk
CONTACT:Stephen Clark
DESCRIPTION:This is an introduction to the field of infinite games\, which
  is relevant to computer science due to its deep links to the automata the
 ory\, and its application to the verification of computer systems.\nInfini
 te 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 t
 he winner depends on the properties of the infinite path\nresulting from t
 he players' movements. I will start with the well known finite automata on
  finite words\, and proceed to automata on infinite structures\, and infin
 ite games.\n
LOCATION:Lecture Theatre 1\, Computer Laboratory
END:VEVENT
END:VCALENDAR