Dicing on the Streett

DOI10.1016/j.ipl.2007.04.010zbMath1184.68338OpenAlexW2084132452MaRDI QIDQ2379984

Florian Horn

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.04.010

zbMATH Keywords

graph algorithmsgamesrandomnessmemory

Mathematics Subject Classification ID

Games involving graphs (91A43) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

Stochastic Games with Finitary Objectives ⋮ Deciding Parity Games in Quasi-polynomial Time ⋮ The complexity of stochastic Müller games ⋮ Stochastic Müller Games are PSPACE-Complete

Cites Work

• Unnamed Item
• Unnamed Item
• Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• On the synthesis of strategies in infinite games
• Computer Science Logic
• Automata, Languages and Programming

This page was built for publication: Dicing on the Streett