Pages that link to "Item:Q1276252"
From MaRDI portal
The following pages link to Infinite games on finitely coloured graphs with applications to automata on infinite trees (Q1276252):
Displaying 50 items.
- (Q5020998) (← links)
- (Q5028462) (← links)
- (Q5028465) (← links)
- (Q5028483) (← links)
- Family-Based SPL Model Checking Using Parity Games with Variability (Q5039535) (← links)
- Extended Sprague–Grundy theory for locally finite games, and applications to random game-trees (Q5041717) (← links)
- The Theory of Universal Graphs for Infinite Duration Games (Q5043588) (← links)
- Deciding Parity Games in Quasi-polynomial Time (Q5073521) (← links)
- (Q5079761) (← links)
- Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games (Q5089201) (← links)
- (Q5089289) (← links)
- (Q5089306) (← links)
- (Q5090498) (← links)
- Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions (Q5090979) (← links)
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time (Q5092368) (← links)
- (Q5111624) (← links)
- VLDL satisfiability and model checking via tree automata (Q5136340) (← links)
- Monoidal-closed categories of tree automata (Q5220183) (← links)
- (Q5227517) (← links)
- (Q5232902) (← links)
- Abstraction in Fixpoint Logic (Q5277894) (← links)
- Computer Science Logic (Q5292636) (← links)
- Optimizing Winning Strategies in Regular Infinite Games (Q5448640) (← links)
- On Reachability Games of Ordinal Length (Q5448648) (← links)
- The Complexity of Nash Equilibria in Infinite Multiplayer Games (Q5458348) (← links)
- Stochastic Games with Lossy Channels (Q5458349) (← links)
- The Complexity of CTL* + Linear Past (Q5458359) (← links)
- Stochastic Müller Games are PSPACE-Complete (Q5458855) (← links)
- Solving Parity Games in Big Steps (Q5458856) (← links)
- (Q5743484) (← links)
- Good-for-Game QPTL: An Alternating Hodges Semantics (Q5875946) (← links)
- Free \(\mu\)-lattices (Q5960406) (← links)
- An impossibility result in automata-theoretic reinforcement learning (Q6103159) (← links)
- Dissecting \texttt{ltlsynt} (Q6151759) (← links)
- A matrix-based approach to parity games (Q6535384) (← links)
- With a little help from your friends: semi-cooperative games via joker moves (Q6535468) (← links)
- A direct symbolic algorithm for solving stochastic Rabin games (Q6535608) (← links)
- Practical applications of the alternating cycle decomposition (Q6535610) (← links)
- On-the-fly solving for symbolic parity games (Q6535612) (← links)
- A flexible toolchain for symbolic Rabin games under fair and stochastic uncertainties (Q6535676) (← links)
- Infinite separation between general and chromatic memory (Q6547948) (← links)
- Round- and context-bounded control of dynamic pushdown systems (Q6564172) (← links)
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism (Q6566473) (← links)
- Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs (Q6566586) (← links)
- Characterizing positionality in games of Infinite duration over infinite graphs (Q6566588) (← links)
- Fast symbolic algorithms for omega-regular games under strong transition fairness (Q6566589) (← links)
- Complexity results for modal logic with recursion via translations and tableaux (Q6597964) (← links)
- Half-positional objectives recognized by deterministic Büchi automata (Q6597970) (← links)
- Priority promotion with Parysian flair (Q6627044) (← links)
- Fair \(\omega \)-regular games (Q6629447) (← links)
