Sciweavers

Share
FCT
2007
Springer

Complexity of Pebble Tree-Walking Automata

9 years 2 months ago
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.
Mathias Samuelides, Luc Segoufin
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where FCT
Authors Mathias Samuelides, Luc Segoufin
Comments (0)
books