Complexity of Pebble Tree-Walking Automata

DOI10.1007/978-3-540-74240-1_40zbMath1135.68459OpenAlexW1506200919MaRDI 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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (6)

Parameter reduction and automata evaluation for grammar-compressed trees ⋮ 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 ⋮ The time complexity of typechecking tree-walking tree transducers ⋮ Two-way pebble transducers for partial functions and their composition

This page was built for publication: Complexity of Pebble Tree-Walking Automata