The following pages link to TYPENESS FOR ω-REGULAR AUTOMATA (Q5484907):
Displaying 12 items.
- Alternation and \(\omega\)-type Turing acceptors (Q1088417) (← links)
- Cycle detection in computation tree logic (Q1784962) (← links)
- Certifying inexpressibility (Q2233423) (← links)
- Types from Frames as Finite Automata (Q2835042) (← links)
- Automata Theory and Model Checking (Q3176362) (← links)
- (Q3384896) (← links)
- Mechanizing the Powerset Construction for Restricted Classes of ω-Automata (Q3510798) (← links)
- The Quest for a Tight Translation of Büchi to co-Büchi Automata (Q3586001) (← links)
- (Q5015276) (← links)
- How Deterministic are Good-For-Games Automata? (Q5136308) (← links)
- (Q6070602) (← links)
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism (Q6566473) (← links)