Complexity of Pebble Tree-Walking Automata
From MaRDI portal
Publication:5444984
DOI10.1007/978-3-540-74240-1_40zbMath1135.68459MaRDI QIDQ5444984
Luc Segoufin, Mathias Samuelides
Publication date: 26 February 2008
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74240-1_40
Related Items
Pebble Weighted Automata and Weighted Logics, Parameter reduction and automata evaluation for grammar-compressed trees, Two-way pebble transducers for partial functions and their composition, The time complexity of typechecking tree-walking tree transducers, XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles, Adding pebbles to weighted automata: easy specification \& efficient evaluation