254 search results - page 3 / 51 » Restarting Tree Automata |
LATA
2010
Springer
13 years 4 months ago
2010
Springer
FUIN
2010
13 years 2 months ago
2010
WIA
2009
Springer
13 years 12 months ago
2009
Springer
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 le...
ADL
2000
Springer
13 years 9 months ago
2000
Springer
We address the problem of tight XML schemas and propose regular tree automata to model XML data. We show that the tree automata model is more powerful that the XML DTDs and is clo...
JUCS
2002
13 years 4 months ago
2002
Abstract: In this paper we introduce the concept of the quasi-product of tree automata. In a quasi-product the inputs of the component tree automata are operational symbols in whic...