Pages that link to "Item:Q3617728"

The following pages link to Tighter Bounds for the Determinisation of Büchi Automata (Q3617728):

Displaying 32 items.

• Solving parity games in big steps (Q340584) (← links)
• Parametric linear dynamic logic (Q515660) (← links)
• Program repair without regret (Q746769) (← links)
• CEGAR for compositional analysis of qualitative properties in Markov decision processes (Q746785) (← links)
• A power-set construction for reducing Büchi automata to non-determinism degree two (Q845908) (← links)
• Profile trees for Büchi word automata, with application to determinization (Q897653) (← links)
• A tighter analysis of Piterman's Büchi determinization (Q989532) (← links)
• Safraless LTL synthesis considering maximal realizability (Q1674867) (← links)
• Bound problems in predicate networks and networks of weakly initial automata (Q1974335) (← links)
• \( \omega \)-automata (Q2074208) (← links)
• Seminator 2 can complement generalized Büchi automata via improved semi-determinization (Q2226719) (← links)
• Strategic reasoning with a bounded number of resources: the quest for tractability (Q2238736) (← links)
• From LTL to deterministic automata. A safraless compositional approach (Q2363815) (← links)
• Index appearance record with preorders (Q2675810) (← links)
• (Q2754186) (← links)
• Automata Theory and Model Checking (Q3176362) (← links)
• New Optimizations and Heuristics for Determinization of Büchi Automata (Q3297598) (← links)
• Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis (Q3297602) (← links)
• Index Appearance Record for Transforming Rabin Automata into Parity Automata (Q3303907) (← links)
• (Q3384171) (← links)
• A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata (Q3638092) (← links)
• Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata (Q4649286) (← links)
• (Q5092321) (← links)
• Model Checking Omega-regular Properties for Quantum Markov Chains (Q5111649) (← links)
• Ramsey-Based Inclusion Checking for Visibly Pushdown Automata (Q5277899) (← links)
• A Decision Procedure for CTL* Based on Tableaux and Automata (Q5747771) (← links)
• On the complexity of resource-bounded logics (Q5915568) (← links)
• Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition (Q6487334) (← links)
• Guessing winning policies in LTL synthesis by semantic learning (Q6535642) (← links)
• From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism (Q6566473) (← links)
• Priority promotion with Parysian flair (Q6627044) (← links)
• On the size of disjunctive formulas in the \(\mu\)-calculus (Q6649531) (← links)