Half-Positional Objectives Recognized by Deterministic Büchi Automata

05/03/2022
by   Patricia Bouyer, et al.
0

A central question in the theory of two-player games over graphs is to understand which objectives are half-positional, that is, which are the objectives for which the protagonist does not need memory to implement winning strategies. Objectives for which both players do not need memory have already been characterized (both in finite and infinite graphs). However, less is known about half-positional objectives. In particular, no characterization of half-positionality is known for the central class of omega-regular objectives. In this paper, we characterize objectives recognizable by deterministic Büchi automata (a class of omega-regular objectives) that are half-positional, in both finite and infinite graphs. Our characterization consists of three natural conditions linked to the language-theoretic notion of right congruence. Furthermore, this characterization yields a polynomial-time algorithm to decide half-positionality of an objective recognized by a given deterministic Büchi automaton.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset