Pages that link to "Item:Q1314640"

The following pages link to Infinite games played on finite graphs (Q1314640):

Displaying 50 items.

• Parameterized Algorithms for Parity Games (Q2946404) (← links)
• Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games (Q2961570) (← links)
• The Modal μ-Calculus Caught Off Guard (Q3010366) (← links)
• Extracting Winning Strategies in Update Games (Q3091450) (← links)
• The mu-calculus and Model Checking (Q3176384) (← links)
• Graph Games and Reactive Synthesis (Q3176385) (← links)
• Admissible Strategies in Infinite Games over Graphs (Q3182935) (← links)
• Synthesis for Structure Rewriting Systems (Q3182943) (← 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)
• (Q3384167) (← links)
• (Q3384169) (← links)
• (Q3384882) (← links)
• Symmetric Strategy Improvement (Q3449491) (← links)
• FINE HIERARCHY OF REGULAR APERIODIC ω-LANGUAGES (Q3538855) (← links)
• Strategy Construction for Parity Games with Imperfect Information (Q3541028) (← links)
• Solving μ-Calculus Parity Games by Symbolic Planning (Q3614877) (← links)
• A selection property of the boolean $\mu $-calculus and some of its applications (Q4380557) (← links)
• Games with Unknown Past (Q4393169) (← links)
• (Q4414504) (← links)
• Deciding the unguarded modal -calculus (Q4583323) (← links)
• <i>μ</i>-Bicomplete Categories and Parity Games (Q4787834) (← links)
• (Q4982350) (← links)
• (Q5013885) (← links)
• (Q5020527) (← links)
• (Q5028462) (← links)
• The Theory of Universal Graphs for Infinite Duration Games (Q5043588) (← links)
• Deciding Parity Games in Quasi-polynomial Time (Q5073521) (← links)
• (Q5079761) (← links)
• Büchi Good-for-Games Automata Are Efficiently Recognizable (Q5090951) (← links)
• Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time (Q5092368) (← links)
• Infinite Games on Finite Graphs Using Grossone (Q5122310) (← links)
• (Q5232902) (← links)
• Computer Science Logic (Q5311285) (← links)
• Church’s Problem and a Tour through Automata Theory (Q5452202) (← links)
• Solving Parity Games in Big Steps (Q5458856) (← links)
• (Q5742223) (← links)
• (Q5743484) (← links)
• Computer Aided Verification (Q5900671) (← links)
• Free \(\mu\)-lattices (Q5960406) (← links)
• Taming strategy logic: non-recurrent fragments (Q6077842) (← links)
• An impossibility result in automata-theoretic reinforcement learning (Q6103159) (← links)
• Continuous Positional Payoffs (Q6135780) (← links)
• On-the-fly solving for symbolic parity games (Q6535612) (← links)
• Safe environmental envelopes of discrete systems (Q6535638) (← links)
• Effective strategies for enumeration games (Q6560179) (← links)
• From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism (Q6566473) (← links)
• Characterizing positionality in games of Infinite duration over infinite graphs (Q6566588) (← links)
• Priority promotion with Parysian flair (Q6627044) (← links)
• Characterizing positionality in games of infinite duration over infinite graphs (Q6649452) (← links)