Infinite games played on finite graphs
- 1 December 1993
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 65 (2) , 149-184
- https://doi.org/10.1016/0168-0072(93)90036-d
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Unforgettable Forgetful DeterminacyJournal of Logic and Computation, 1994
- Gurevich-Harrington's games defined by finite automataAnnals of Pure and Applied Logic, 1993
- Extension of Gurevich-Harrington's restricted memory determinacy theorem: a criterion for the winning player and an explicit class of winning strategiesAnnals of Pure and Applied Logic, 1990
- Solving sequential conditions by finite-state strategiesTransactions of the American Mathematical Society, 1969