Searching for "Tree-Walking Automata." – sorted by Relevance.
-
Tree-walking automata
- Tree-walking automata Mikołaj Bojańczyk ⋆ Warsaw University Abstract. A survey of tree-walking
- Add To MetaCart
-
On the power of tree-walking automata
- ? On the Power of Tree-Walking Automata Frank Neven ? Limburgs Universitair Centrum and Thomas
- Cited by 26 (3 self) – Add To MetaCart
-
Tree-Walking Automata Cannot Be Determinized
- Tree-Walking Automata Cannot Be Determinized Mikoaj Bojaczyk and Thomas Colcombet Uniwersytet
- Cited by 7 (2 self) – Add To MetaCart
-
Complexity of pebble tree-walking automata
- Complexity of pebble tree-walking automata Mathias Samuelides and Luc Segoufin LIAFA, Paris 7
- Cited by 2 (0 self) – Add To MetaCart
-
XPath, transitive closure logic, and nested tree walking automata
- of nested tree-walking automata. Using the latter we then proceed to show that the language is strictly less
- Cited by 3 (0 self) – Add To MetaCart
-
Tree-Walking Automata and Monadic Second Order Logic
- Tree-Walking Automata and Monadic Second Order Logic Jan-Pascal van Best July 9, 1999 Preface
- Cited by 2 (1 self) – Add To MetaCart
-
Tree-walking automata do not recognize all regular languages
- Tree-Walking Automata Do Not Recognize All Regular Languages ABSTRACT Mikolaj Bojanczyk ∗ Warsaw
- Cited by 9 (1 self) – Add To MetaCart
-
Tree-Walking Pebble Automata
- Tree-Walking Pebble Automata ? Joost Engelfriet and Hendrik Jan Hoogeboom Institute of Computer
- Cited by 27 (2 self) – Add To MetaCart
-
1-bounded TWA Cannot Be Determinized
- show a very simple language not recognized by 1-TWA. 1 Introduction Tree-walking Automata (TWA
- Cited by 3 (0 self) – Add To MetaCart
-
Looping caterpillars
- addition to tree walk automata and the corresponding caterpillar expressions. These are evaluated
- Cited by 5 (0 self) – Add To MetaCart

