The following pages link to Alternating tree automata (Q1077932):
Displaying 15 items.
- Decidable containment of recursive queries (Q555766) (← links)
- Decidability of equivalence for deterministic synchronized tree automata (Q671682) (← links)
- The time complexity of typechecking tree-walking tree transducers (Q1014274) (← links)
- Concurrent program schemes and their logics (Q1094866) (← links)
- A grammatical characterization of alternating pushdown automata (Q1123637) (← links)
- Top-down tree transducers with two-way tree walking look-ahead (Q1185007) (← links)
- Synchronized tree automata (Q1325832) (← links)
- Yield-languages of two-way pushdown tree automata (Q1352013) (← links)
- Decision procedures for inductive Boolean functions based on alternating automata (Q1399969) (← links)
- The finite graph problem for two-way alternating automata. (Q1874281) (← links)
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity (Q2022308) (← links)
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles (Q2216430) (← links)
- Alternating two-way AC-tree automata (Q2373699) (← links)
- An Infinite Automaton Characterization of Double Exponential Time (Q3540169) (← links)
- Decidability of equivalence for deterministic synchronized tree automata (Q5096728) (← links)
