Pages that link to "Item:Q5492884"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2005 (Q5492884):
Displayed 11 items.
- A survey of stochastic \(\omega \)-regular games (Q414898) (← links)
- The complexity of stochastic Müller games (Q418128) (← links)
- Assume-admissible synthesis (Q520340) (← links)
- On Müller context-free grammars (Q764314) (← links)
- Extracting Winning Strategies in Update Games (Q3091450) (← links)
- Decision Problems for Nash Equilibria in Stochastic Games (Q3644770) (← links)
- (Q5009445) (← links)
- Deciding Parity Games in Quasi-polynomial Time (Q5073521) (← links)
- On Reachability Games of Ordinal Length (Q5448648) (← links)
- Stochastic Müller Games are PSPACE-Complete (Q5458855) (← links)
- Zielonka DAG acceptance and regular languages over infinite words (Q6067335) (← links)