Memory Reduction for Strategies in Infinite Games

DOI10.1007/978-3-540-76336-9_24zbMath1139.68364OpenAlexW1541885445MaRDI QIDQ3503911

Michael Holtmann, Christof Löding

Publication date: 10 June 2008

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-76336-9_24

zbMATH Keywords

reductionattractorstrategyinfinite gamesautomatonmemory reductionBüchiDWAGAStrequest-response gameStaiger-Wagner game

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (2)

Memory Reduction for Strategies in Infinite Games ⋮ Optimizing Winning Strategies in Regular Infinite Games

Cites Work

• Unnamed Item
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Efficient minimization of deterministic weak \(\omega\)-automata
• Memory Reduction for Strategies in Infinite Games
• Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications
• Simulation Relations for Alternating Parity Automata and Parity Games
• On the synthesis of strategies in infinite games
• Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
• Solving Sequential Conditions by Finite-State Strategies

This page was built for publication: Memory Reduction for Strategies in Infinite Games