Pages that link to "Item:Q5426071"
From MaRDI portal
The following pages link to From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata (Q5426071):
Displaying 16 items.
- Solving parity games in big steps (Q340584) (← links)
- Antichains and compositional algorithms for LTL synthesis (Q453498) (← links)
- Symbolic bounded synthesis (Q453535) (← links)
- Reactive synthesis without regret (Q520338) (← links)
- Program repair without regret (Q746769) (← links)
- Equilibria for games with combined qualitative and quantitative objectives (Q824280) (← 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)
- Looking at mean payoff through foggy windows (Q1629743) (← links)
- Safraless LTL synthesis considering maximal realizability (Q1674867) (← links)
- On relative and probabilistic finite counterability (Q1742987) (← links)
- Opacity for linear constraint Markov chains (Q1745942) (← links)
- Reasoning about Quality and Fuzziness of Strategic Behaviors (Q6116358) (← links)
- FORQ-Based Language Inclusion Formal Testing (Q6487332) (← links)
- Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition (Q6487334) (← links)
- Complementing Büchi Automata with Ranker (Q6487336) (← links)
