PLAYING MULLER GAMES IN A HURRY

DOI10.1142/S0129054112400321zbMath1246.91018MaRDI QIDQ2909222

Martín G. Zimmermann, John Fearnley

Publication date: 30 August 2012

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

Muller gameswinning strategiesZielonka's algorithm

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Formal languages and automata (68Q45) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (2)

Down the Borel hierarchy: solving Muller games via safety games ⋮ Quantitative reductions and vertex-ranked infinite games

Cites Work

• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Infinite games played on finite graphs

This page was built for publication: PLAYING MULLER GAMES IN A HURRY