The following pages link to (Q3902489):
Displaying 8 items.
- Efficient inclusion checking for deterministic tree automata and XML schemas (Q1041037) (← links)
- Automata on infinite trees (Q2074210) (← links)
- Deciding top-down determinism of regular tree languages (Q2140513) (← links)
- Deterministic top-down tree automata with Boolean deterministic look-ahead (Q2163373) (← links)
- Variants of top-down tree transducers with look-ahead (Q3832064) (← links)
- A Congruence-Based Perspective on Finite Tree Automata (Q5025071) (← links)
- Checking in polynomial time whether or not a regular tree language is deterministic top-down (Q6121430) (← links)
- On the Boolean Closure of Deterministic Top-Down Tree Automata (Q6154972) (← links)
