54 search results - page 5 / 11 » Deterministic Automata on Unranked Trees |
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...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper we generalize the contraction method, originally proposed by Elgot and Rabin and later extended by Carton and Thomas, from labeled linear orderings to colored determ...
IANDC
2011
13 years 2 months ago
2011
Query answering algorithms on Xml streams check answer candidates on the fly in order to avoid the unnecessary buffering whenever possible. The delay and concurrency of a query ...
LICS
1996
IEEE
13 years 11 months ago
1996
IEEE
In the automata-theoretic approach to verification, we translate specifications to automata. Complexity considerations motivate the distinction between different types of automata...
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...