The following pages link to (Q4941149):
Displaying 18 items.
- Two-way pebble transducers for partial functions and their composition (Q748432) (← links)
- Tree-walking automata cannot be determinized (Q817841) (← links)
- Deciding determinism of caterpillar expressions (Q840761) (← links)
- Complementing deterministic tree-walking automata (Q845667) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- A linear-time algorithm for the feasibility of pebble motion on trees (Q1283933) (← links)
- On the power of tree-walking automata. (Q1401944) (← links)
- Parametric random generation of deterministic tree automata (Q1959655) (← links)
- Reversibility of computations in graph-walking automata (Q2216129) (← links)
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles (Q2216430) (← links)
- Adding pebbles to weighted automata: easy specification \& efficient evaluation (Q2447753) (← links)
- Translation from classical two-way automata to pebble two-way automata (Q2998731) (← links)
- On the Hybrid Extension of CTL and CTL + (Q3182944) (← links)
- Deterministic Caterpillar Expressions (Q3503898) (← links)
- Random Generation of Deterministic Tree (Walking) Automata (Q3637348) (← links)
- GETGRATS (Q4923529) (← links)
- A linear time algorithm for the feasibility of pebble motion on trees (Q5054818) (← links)
- Pebble Weighted Automata and Weighted Logics (Q5169971) (← links)