Abstract
We show that solving delay games with winning conditions given by deterministic and non-deterministic weak Muller automata is 2EXPTIME-complete respectively 3EXPTIME-complete. Furthermore, doubly- and triply-exponential lookahead is necessary and sufficient to win such games. These results are the first that show that the succinctness of the automata types used to specify the winning conditions has an influence on the complexity of these problems.
Originalsprog | Engelsk |
---|---|
Titel | Lecture Notes Series, Institute for Mathematical Sciences |
Redaktører | Noam Greenberg, Sanjay Jain, Yue Yang, Frank Stephan, Keng Meng Ng, Guohua Wu, Sven Schewe |
Antal sider | 40 |
Forlag | World Scientific Publishing Co. |
Publikationsdato | 2024 |
Sider | 425-464 |
DOI | |
Status | Udgivet - 2024 |
Navn | Lecture Notes Series, Institute for Mathematical Sciences |
---|---|
Vol/bind | 42 |
ISSN | 1793-0758 |
Bibliografisk note
Publisher Copyright:© 2024 World Scientific Publishing Company.