23 search results - page 1 / 5 » An Implementation of Deterministic Tree Automata Minimizatio... |
108
Voted
WIA
2007
Springer
15 years 9 months ago
2007
Springer
134
Voted
WIA
2009
Springer
15 years 10 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...
121
Voted
FCT
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is poss...
138
Voted
JCSS
2007
15 years 3 months ago
2007
Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of efficiently minimizing such automata. First, we study unrank...
141
Voted
TCS
2010
14 years 10 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...