Pages that link to "Item:Q4953338"
From MaRDI portal
The following pages link to Computing the Rabin Index of a Parity Automaton (Q4953338):
Displayed 7 items.
- The Rabin index of parity games: its complexity and approximation (Q897647) (← links)
- A gap property of deterministic tree languages. (Q1401364) (← links)
- Automata on infinite trees (Q2074210) (← links)
- New Optimizations and Heuristics for Determinization of Büchi Automata (Q3297598) (← links)
- Deciding low levels of tree-automata hierarchy (Q4916202) (← links)
- (Q5014447) (← links)
- On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words (Q6094518) (← links)