130
click to vote
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
Tree-walking automata are a natural sequential model for recognizing languages of finite trees. Such automata walk around the tree and may decide in the end to accept it. It is s...