One-to-two-player lifting for mildly growing memory

DOI10.4230/LIPICS.STACS.2022.43MaRDI QIDQ6490989zbMATH OpenFDO

Authors Alexander Kozachinskiy

Publication date 23 April 2024

zbMATH Keywords

games on graphspositional determinacyfinite-memory determinacystrategy complexityone-to-two-player lifting

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(2)

• Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs
• Half-positional objectives recognized by deterministic Büchi automata

This page was built for publication: One-to-two-player lifting for mildly growing memory

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