2 search results - page 1 / 1 » One-Visit Caterpillar Tree Automata |
62
Voted
FUIN
2002
15 years 3 days ago
2002
We study caterpillar tree automata [3] that are restricted to enter any subtree at most one time (or k times). We show that, somewhat surprisingly, the deterministic one-visit aut...
98
Voted
LICS
2005
IEEE
15 years 6 months ago
2005
IEEE
There are two main paradigms for querying semi structured data: regular path queries and XPath. The aim of this paper is to provide a synthesis between these two. This synthesis i...