![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Eryk Kopczynski
Wednesday 11 May 2011, 14:15-15:15
From deterministic finite automata to infinite games
- đ¤ Speaker: Eryk Kopczynski
- đ Date & Time: Wednesday 11 May 2011, 14:15 - 15:15
- đ Venue: Lecture Theatre 1, Computer Laboratory
Questions? Contact
Stephen Clark
Abstract
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.
Series This talk is part of the Wednesday Seminars - Department of Computer Science and Technology series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Chris Davis' list
- computer science
- Department of Computer Science and Technology talks and seminars
- Graduate-Seminars
- Guy Emerson's list
- Interested Talks
- Lecture Theatre 1, Computer Laboratory
- Martin's interesting talks
- School of Technology
- se393's list
- Trust & Technology Initiative - interesting events
- Wednesday Seminars - Department of Computer Science and Technology
- yk449
Note: Ex-directory lists are not shown.