The following pages link to Relating word and tree automata (Q2576943):
Displaying 12 items.
- On Synthesis of Specifications with Arithmetic (Q3297765) (← links)
- Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata (Q3644751) (← links)
- (Q5021013) (← links)
- Minimizing GFG Transition-Based Automata (Q5091262) (← links)
- (Q5101349) (← links)
- How Deterministic are Good-For-Games Automata? (Q5136308) (← links)
- (Q5232903) (← links)
- (Q5875380) (← links)
- On the power of finite ambiguity in Büchi complementation (Q6040669) (← links)
- A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct (Q6137877) (← links)
- A Myhill-Nerode theorem for higher-dimensional automata (Q6535191) (← links)
- History-deterministic timed automata (Q6635511) (← links)
