Expressive Power of Pebble Automata
From MaRDI portal
Recommendations
Cited in
(19)- Complexity results for two-way and multi-pebble automata and their logics
- On pebble automata for data languages with decidable emptiness problem
- 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
- On Pebble Automata for Data Languages with Decidable Emptiness Problem
- Pebble alternating tree-walking automata and their recognizing power
- scientific article; zbMATH DE number 1354852 (Why is no real title available?)
- Complexity results for multi-pebble automata and their logics
- scientific article; zbMATH DE number 1886325 (Why is no real title available?)
- scientific article; zbMATH DE number 1408335 (Why is no real title available?)
- Pebble weighted automata and weighted logics
- Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
- Complexity of Pebble Tree-Walking Automata
- Plane-walking automata
- A time to cast away stones
- A time to cast away stones: on a family of pebble automata
- Two-way pebble transducers for partial functions and their composition
- Streaming tree automata
This page was built for publication: Expressive Power of Pebble Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613757)
