Gurevich-Harrington's games defined by finite automata (Q685082)

The paper considers 2-player games in extended form described by an alphabet of possible moves and the subset of the winning plays of the players (where a play is a sequence -- finite or infinite -- of moves chosen alternately by the players). The finite automaton model used for the analysis of such games allows to study their properties and effectively find the winning player. The components of the game are transformed in a transition table of the automaton representing the game, and processing that transmission table leads to the derivation of general conditions determining the winner.