Games with Winning Conditions of High Borel Complexity - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2006

Games with Winning Conditions of High Borel Complexity

Résumé

We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Sigma_3-complete in the Borel hierarchy. This was the first example of a decidable winning condition of such Borel complexity. We extend this result by giving a family of decidable winning conditions of arbitrary finite Borel complexity. From this family, we deduce a family of decidable winning conditions of arbitrary finite Borel complexity for games played on finite graphs. The problem of deciding the winner for these conditions is shown to be non-elementary.
Fichier principal
Vignette du fichier
Final_TCS2.pdf (325.29 Ko) Télécharger le fichier

Dates et versions

hal-00012136 , version 1 (17-10-2005)

Identifiants

Citer

Olivier Serre. Games with Winning Conditions of High Borel Complexity. Theoretical Computer Science, 2006, 350 (2-3), pp.345-372. ⟨10.1016/j.tcs.2005.10.024⟩. ⟨hal-00012136⟩
87 Consultations
91 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More