206 search results - page 1 / 42 » Deterministic Caterpillar Expressions |
WIA
2007
Springer
13 years 11 months ago
2007
Springer
FUIN
2002
13 years 4 months 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...
LICS
2005
IEEE
13 years 10 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...
APWEB
2011
Springer
12 years 11 months ago
2011
Springer
One difficulty in the design of XML Schema is the restriction that the content models should be deterministic, i. e., the Unique Particle Attribution (UPA) constraint, which means ...
ICC
2011
IEEE
12 years 4 months ago
2011
IEEE
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...