Search

• < Previous
• 1
• Next >

Half-Positional Objectives Recognized by Deterministic B\"uchi Automata

In two-player games on graphs, the simplest possible strategies are those that can be implemented without any memory. These are called positional strategies. In this paper, we characterize objectives recognizable by deterministic B\"uchi automata (a subclass of omega-regular objectives) that are&nbsp;[&hellip;]