Characterising memory in infinite games
From MaRDI portal
Cites work
- A decomposition theorem for partially ordered sets
- Arena-independent finite-memory determinacy in stochastic games
- Characterising memory in Infinite games
- Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs
- Characterizing positionality in games of Infinite duration over infinite graphs
- CONCUR 2005 – Concurrency Theory
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
- Games where you can play optimally with arena-independent finite memory
- Half-positional objectives recognized by deterministic Büchi automata
- How to play optimally for regular objectives?
- scientific article; zbMATH DE number 2206109 (Why is no real title available?)
- scientific article; zbMATH DE number 7830368 (Why is no real title available?)
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Introduction to axiomatic set theory
- On Dilworth's theorem in the infinite case
- On the positional determinacy of edge-labeled games
- On the size of good-for-games Rabin automata and its link with the memory in Muller games
- Playing Safe
- Positional -regular languages
- Topological extension of parity automata
- Universal graphs and good for games automata: new tools for infinite duration games
Cited in
(3)
This page was built for publication: Characterising memory in infinite games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7007743)
