1000 search results - page 6 / 200 » Dependency Tree Automata |
LATA
2009
Springer
14 years 4 months ago
2009
Springer
WIA
2005
Springer
14 years 3 months ago
2005
Springer
The complexity of various membership problems for tree automata on compressed trees is analyzed. Two compressed representations are considered: dags, which allow to share identical...
LICS
2009
IEEE
14 years 4 months ago
2009
IEEE
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
FUIN
2002
13 years 9 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...
RTA
2004
Springer
14 years 3 months ago
2004
Springer
The problem of selecting nodes in unranked trees is the most basic querying problem for XML. We propose stepwise tree automata for querying unranked trees. Stepwise tree automata c...