Tree-walking automata

13

ICALP
2004
Springer

119views Programming Languages» more ICALP 2004»

Tree-Walking Automata Cannot Be Determinized

13 years 10 months ago

Tree-walking automata are a natural sequential model for recognizing languages of ﬁnite trees. Such automata walk around the tree and may decide in the end to accept it. It is s...

Mikolaj Bojanczyk, Thomas Colcombet

claim paper

Read More »

16

click to vote

FCT
2007
Springer

123views Applied Computing» more FCT 2007»

Complexity of Pebble Tree-Walking Automata

13 years 10 months ago

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,...

Mathias Samuelides, Luc Segoufin

claim paper

Read More »

7

click to vote

STOC
2005
ACM

85views Algorithms» more STOC 2005»

Tree-walking automata do not recognize all regular languages

14 years 4 months ago