Pages that link to "Item:Q1109572"
From MaRDI portal
The following pages link to On alternating \(\omega\)-automata (Q1109572):
Displaying 19 items.
- A note on alternating on-line Turing machines (Q789181) (← links)
- Alternating finite automata on \(\omega\)-words (Q796990) (← links)
- On the power of alternation in automata theory (Q1068537) (← links)
- Alternation and \(\omega\)-type Turing acceptors (Q1088417) (← links)
- Alternating automata on infinite trees (Q1098325) (← links)
- Accepting conditions for automata on \(\omega\)-languages (Q1116351) (← links)
- \(\omega\)-languages accepted by finite automata whose structures are cascade products o resets (Q1183179) (← links)
- Alternating automata, the weak monadic theory of trees and its complexity (Q1193871) (← links)
- A note on the emptiness problem for alternating finite-memory automata (Q2437765) (← links)
- Mechanizing the Powerset Construction for Restricted Classes of ω-Automata (Q3510798) (← links)
- Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique (Q3518271) (← links)
- Short Witnesses and Accepting Lassos in ω-Automata (Q3564867) (← links)
- Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique (Q3591446) (← links)
- (Q3687716) (← links)
- (Q3748266) (← links)
- (Q3779749) (← links)
- (Q3782787) (← links)
- On the Way to Alternating Weak Automata (Q5090957) (← links)
- (Q5114824) (← links)