254 search results - page 1 / 51 » Restarting Tree Automata |
CAI
2007
Springer
13 years 10 months ago
2007
Springer
CAI
2009
Springer
13 years 11 months ago
2009
Springer
SOFSEM
2007
Springer
13 years 10 months ago
2007
Springer
ICALP
2004
Springer
13 years 9 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...
LATA
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS) as formalizations of the ling...