The following pages link to Tree-Walking Automata (Q3540091):
Displayed 15 items.
- Deciding twig-definability of node selecting tree automata (Q269327) (← links)
- Parameter reduction and automata evaluation for grammar-compressed trees (Q440015) (← links)
- Loops and overloops for tree-walking automata (Q442148) (← links)
- Uniform \textit{vs.} nonuniform membership for mildly context-sensitive languages: a brief survey (Q1736791) (← links)
- The uniform measure of simple regular sets of infinite trees (Q2029602) (← links)
- Automata on finite trees (Q2074209) (← links)
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles (Q2216430) (← links)
- On labeled birooted tree languages: algebras, automata and logic (Q2347808) (← links)
- Adding pebbles to weighted automata: easy specification \& efficient evaluation (Q2447753) (← links)
- Verification of component-based systems with recursive architectures (Q2699967) (← links)
- On Models of a Nondeterministic Computation (Q3392968) (← links)
- (Q5092424) (← links)
- Loops and Overloops for Tree Walking Automata (Q5200062) (← links)
- Plane-Walking Automata (Q5501619) (← links)
- Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs (Q6178459) (← links)