Complexity of Pebble Tree-Walking Automata

We consider tree-walking automata using k pebbles. The pebbles are either strong (can be lifted from anywhere) or weak (can be lifted only when the automaton is on it). For each k, we give the precise complexities of the problems of emptiness and inclusion of tree-walking automata using k pebbles.

• Type: Conference
• Year: 2007
• Where: FCT
• Authors: Mathias Samuelides, Luc Segoufin
• Keywords: FCT 2007, Pebbles, Precise Complexities, Tree-walking Automata