Mathematical Foundations of Computer Science 2005
From MaRDI portal
Publication:5492884
DOI10.1007/11549345zbMath1156.68392OpenAlexW2494705596MaRDI QIDQ5492884
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11549345
Games involving graphs (91A43) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (11)
Deciding Parity Games in Quasi-polynomial Time ⋮ Zielonka DAG acceptance and regular languages over infinite words ⋮ A survey of stochastic \(\omega \)-regular games ⋮ The complexity of stochastic Müller games ⋮ Unnamed Item ⋮ Assume-admissible synthesis ⋮ On Reachability Games of Ordinal Length ⋮ Stochastic Müller Games are PSPACE-Complete ⋮ Extracting Winning Strategies in Update Games ⋮ Decision Problems for Nash Equilibria in Stochastic Games ⋮ On Müller context-free grammars
This page was built for publication: Mathematical Foundations of Computer Science 2005
