Memory Reduction for Strategies in Infinite Games
From MaRDI portal
Recommendations
Cites work
- Efficient minimization of deterministic weak -automata
- Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
- scientific article; zbMATH DE number 3328721 (Why is no real title available?)
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Memory Reduction for Strategies in Infinite Games
- On the synthesis of strategies in infinite games
- Simulation Relations for Alternating Parity Automata and Parity Games
- Solving Sequential Conditions by Finite-State Strategies
- Symbolic synthesis of finite-state controllers for request-response specifications
Cited in
(7)- Quantitative reductions and vertex-ranked infinite games
- The complexity of request-response games
- Quantitative reductions and vertex-ranked infinite games
- Memory Reduction for Strategies in Infinite Games
- What kind of memory is needed to win infinitary Muller games?
- Optimizing Winning Strategies in Regular Infinite Games
- CONCUR 2005 – Concurrency Theory
This page was built for publication: Memory Reduction for Strategies in Infinite Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503911)