Pages that link to "Item:Q3613352"

The following pages link to Solving Games Without Determinization (Q3613352):

Displaying 39 items.

• Synthesis of Reactive(1) designs (Q439954) (← links)
• Symbolic bounded synthesis (Q453535) (← links)
• Reactive synthesis without regret (Q520338) (← links)
• LTL receding horizon control for finite deterministic systems (Q2628417) (← links)
• Quantitative vs. weighted automata (Q2695484) (← links)
• Functional Encryption for Inner Product with Full Function Privacy (Q2798775) (← links)
• Effective Synthesis of Asynchronous Systems from GR(1) Specifications (Q2891421) (← links)
• (Q2947758) (← links)
• On Synthesis of Specifications with Arithmetic (Q3297765) (← links)
• Optimal Translation of LTL to Limit Deterministic Automata (Q3303923) (← links)
• Width of Non-deterministic Automata (Q3304146) (← links)
• On Determinisation of Good-for-Games Automata (Q3449484) (← links)
• (Q3786029) (← links)
• (Q5021013) (← links)
• (Q5028456) (← links)
• Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning (Q5039514) (← links)
• The Theory of Universal Graphs for Infinite Duration Games (Q5043588) (← links)
• Quantifying Bounds in Strategy Logic (Q5079747) (← links)
• Büchi Good-for-Games Automata Are Efficiently Recognizable (Q5090951) (← links)
• (Q5101349) (← links)
• (Q5114824) (← links)
• How Deterministic are Good-For-Games Automata? (Q5136308) (← links)
• (Q5207047) (← links)
• From LTL to Symbolically Represented Deterministic Automata (Q5452723) (← links)
• (Q5875380) (← links)
• Good-for-Game QPTL: An Alternating Hodges Semantics (Q5875946) (← links)
• On the power of finite ambiguity in Büchi complementation (Q6040669) (← links)
• Taming strategy logic: non-recurrent fragments (Q6077842) (← links)
• Markov chains and unambiguous automata (Q6098148) (← links)
• A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct (Q6137877) (← links)
• Minimization of automata for liveness languages (Q6160912) (← links)
• Alternating good-for-MDPs automata (Q6160921) (← links)
• Token Games and History-Deterministic Quantitative-Automata (Q6178674) (← links)
• Semantic flowers for good-for-games and deterministic automata (Q6195342) (← links)
• A Myhill-Nerode theorem for higher-dimensional automata (Q6535191) (← links)
• From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism (Q6566473) (← links)
• Coalgebraic satisfiability checking for arithmetic \(\mu\)-calculi (Q6597959) (← links)
• Checking history-determinism is NP-hard for parity automata (Q6629459) (← links)
• History-deterministic timed automata (Q6635511) (← links)