Pages that link to "Item:Q1276252"

The following pages link to Infinite games on finitely coloured graphs with applications to automata on infinite trees (Q1276252):

Displaying 50 items.

• Measure properties of regular sets of trees (Q2407093) (← links)
• A superpolynomial lower bound for strategy iteration based on snare memorization (Q2446310) (← links)
• Marking shortest paths on pushdown graphs does not preserve MSO decidability (Q2629775) (← links)
• Index appearance record with preorders (Q2675810) (← links)
• Automata and Compositional Strategies in Extensive Form Games (Q2817411) (← links)
• Solving Parity Games Using an Automata-Based Algorithm (Q2830208) (← links)
• Playing Muller games in a hurry (Q2909222) (← links)
• Two local strategy iteration schemes for parity game solving (Q2909223) (← links)
• Adaptive synchronization and pinning control of colored networks (Q2944645) (← links)
• Parameterized Algorithms for Parity Games (Q2946404) (← links)
• Infinite-state games with finitary conditions (Q2958522) (← links)
• Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games (Q2961570) (← links)
• Recursive algorithm for parity games requires exponential time (Q3117548) (← links)
• (Q3172528) (← links)
• Minimum Attention Controller Synthesis for Omega-Regular Objectives (Q3172849) (← links)
• Automata Theory and Model Checking (Q3176362) (← links)
• The mu-calculus and Model Checking (Q3176384) (← links)
• Graph Games and Reactive Synthesis (Q3176385) (← links)
• Cooking Your Own Parity Game Preorders Through Matching Plays (Q3177339) (← links)
• Admissible Strategies in Infinite Games over Graphs (Q3182935) (← links)
• From Parity and Payoff Games to Linear Programming (Q3182965) (← links)
• Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition (Q3189650) (← links)
• Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis (Q3297602) (← links)
• (Q3384167) (← links)
• (Q3384882) (← links)
• Symmetric Strategy Improvement (Q3449491) (← links)
• Memory Reduction for Strategies in Infinite Games (Q3503911) (← links)
• The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata (Q3519517) (← links)
• FINE HIERARCHY OF REGULAR APERIODIC ω-LANGUAGES (Q3538855) (← links)
• The Descriptive Complexity of Parity Games (Q3540190) (← links)
• Strategy Construction for Parity Games with Imperfect Information (Q3541028) (← links)
• Modal and mixed specifications: key decision problems and their complexities (Q3550702) (← links)
• Solving μ-Calculus Parity Games by Symbolic Planning (Q3614877) (← links)
• On the Complexity of Branching-Time Logics (Q3644771) (← links)
• Solving Parity Games in Practice (Q3648698) (← links)
• A selection property of the boolean $\mu $-calculus and some of its applications (Q4380557) (← links)
• (Q4414504) (← links)
• <i>μ</i>-Bicomplete Categories and Parity Games (Q4787834) (← links)
• Permissive strategies: from parity games to safety games (Q4800258) (← links)
• Model Checking Games (Q4916199) (← links)
• Polynomial-Time Under-Approximation of Winning Regions in Parity Games (Q4982057) (← links)
• (Q5005144) (← links)
• (Q5013885) (← links)
• (Q5015265) (← links)
• (Q5015267) (← links)
• (Q5015274) (← links)
• (Q5015276) (← links)
• (Q5020527) (← links)
• (Q5020529) (← links)
• (Q5020996) (← links)