Tree-walking pebble automata
From MaRDI portal
Recommendations
Cited in
(25)- A linear-time algorithm for the feasibility of pebble motion on trees
- On the power of tree-walking automata.
- Parametric random generation of deterministic tree automata
- Reversibility of computations in graph-walking automata
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
- Adding pebbles to weighted automata: easy specification \& efficient evaluation
- Translation from classical two-way automata to pebble two-way automata
- On the Hybrid Extension of CTL and CTL +
- Deterministic Caterpillar Expressions
- Expressive Power of Pebble Automata
- Pebble alternating tree-walking automata and their recognizing power
- Random Generation of Deterministic Tree (Walking) Automata
- scientific article; zbMATH DE number 1354852 (Why is no real title available?)
- GETGRATS: a summary of scientific results (with annotated bibliography)
- A linear time algorithm for the feasibility of pebble motion on trees
- Pebble weighted automata and weighted logics
- Complexity of Pebble Tree-Walking Automata
- A time to cast away stones
- A time to cast away stones: on a family of pebble automata
- Nondeterministic tree-walking automata are not closed under complementation
- Two-way pebble transducers for partial functions and their composition
- Tree-walking automata cannot be determinized
- Deciding determinism of caterpillar expressions
- Complementing deterministic tree-walking automata
- Automata for XML -- a survey
This page was built for publication: Tree-walking pebble automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4941149)
