Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs

DOI10.4230/LIPICS.STACS.2022.16MaRDI QIDQ6490967zbMATH OpenFDO

Authors Patricia Bouyer, Mickael Randour, Pierre Vandenhove

Publication date 23 April 2024

zbMATH Keywords

optimal strategies\(\omega\)-regular languagesfinite-memory determinacytwo-player games on graphsinfinite arenas

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(2)

• Playing Safe, Ten Years Later
• Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs

This page was built for publication: Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6490967)