263 search results - page 5 / 53 » Rigid Tree Automata |
WIA
2005
Springer
14 years 1 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...
FUIN
2002
13 years 7 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 29 days 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...
DLT
2008
13 years 9 months ago
2008
Abstract. Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative ...
TCS
2010
13 years 2 months ago
2010
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential l...