Mathematical Foundations of Computer Science 2005
From MaRDI portal
Publication:5492884
DOI10.1007/11549345zbMath1156.68392MaRDI 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
91A43: Games involving graphs
68Q45: Formal languages and automata
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Unnamed Item, Deciding Parity Games in Quasi-polynomial Time, On Reachability Games of Ordinal Length, Stochastic Müller Games are PSPACE-Complete, Zielonka DAG acceptance and regular languages over infinite words, A survey of stochastic \(\omega \)-regular games, The complexity of stochastic Müller games, Assume-admissible synthesis, On Müller context-free grammars, Extracting Winning Strategies in Update Games, Decision Problems for Nash Equilibria in Stochastic Games