Expressive Power of Pebble Automata
From MaRDI portal
Publication:3613757
DOI10.1007/11786986_15zbMath1223.68065OpenAlexW2015791837MaRDI QIDQ3613757
Thomas Schwentick, Mathias Samuelides, Mikołaj Bojańczyk, Luc Segoufin
Publication date: 12 March 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11786986_15
Related Items
On Pebble Automata for Data Languages with Decidable Emptiness Problem ⋮ A time to cast away stones ⋮ 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 ⋮ Pebble Weighted Automata and Weighted Logics ⋮ Streaming tree automata ⋮ Two-way pebble transducers for partial functions and their composition ⋮ Plane-Walking Automata