Sciweavers

254 search results - page 1 / 51
» Restarting Tree Automata
Sort
View
CAI
2009
Springer
13 years 10 months ago
Single-Path Restarting Tree Automata
Friedrich Otto, Heiko Stamer
11
Voted
SOFSEM
2007
Springer
13 years 10 months ago
Restarting Tree Automata
Heiko Stamer, Friedrich Otto
ICALP
2004
Springer
13 years 9 months ago
Tree-Walking Automata Cannot Be Determinized
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...
Mikolaj Bojanczyk, Thomas Colcombet
LATA
2009
Springer
13 years 8 months ago
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata
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...
Dana Pardubská, Martin Plátek, Fried...