| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4950710 | Information and Computation | 2017 | 21 Pages |
Abstract
We show that it is decidable whether a given game satisfies the condition, and prove tight complexity bounds for the strategy synthesis problem under Ï-regular winning conditions given by deterministic parity automata.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Dietmar Berwanger, Anup Basil Mathew,