Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

FCT
2007
Springer

favoriteEmaildiscussreport

123views Applied Computing» more FCT 2007»

Complexity of Pebble Tree-Walking Automata

13 years 11 months ago

Complexity of Pebble Tree-Walking Automata

Download www.lsv.ens-cachan.fr

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

Real-time Traffic

FCT 2007 | Pebbles | Precise Complexities | Tree-walking Automata |

claim paper

Related Content

» Looping Caterpillars

» Random Generation of Deterministic Tree Walking Automata

» XPath transitive closure logic and nested tree walking automata

» Parametric random generation of deterministic tree automata

» XML transformation by treewalking transducers with invisible pebbles

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	FCT
Authors	Mathias Samuelides, Luc Segoufin

Comments (0)