Sciweavers

Share
CSL
2008
Springer

The Descriptive Complexity of Parity Games

9 years 2 days ago
The Descriptive Complexity of Parity Games
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in the modal
Anuj Dawar, Erich Grädel
Added 19 Oct 2010
Updated 19 Oct 2010
Type Conference
Year 2008
Where CSL
Authors Anuj Dawar, Erich Grädel
Comments (0)
books