23 search results - page 3 / 5 » An Implementation of Deterministic Tree Automata Minimizatio... |
DLT
2004
13 years 7 months ago
2004
Bottom-up tree series transducers (tst) over the semiring A are implemented with the help of bottom-up weighted tree automata (wta) over an extension of A. Therefore bottom-up D-w...
WIA
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. We present a reflection on the evolution of the different methods for constructing minimal deterministic acyclic finite-state automata from a finite set of words. We ...
WIA
2007
Springer
13 years 12 months ago
2007
Springer
We improve an existing bisimulation minimisation algorithm for tree automata by introducing backward and forward bisimulations and developing minimisation algorithms for them. Mini...
PLANX
2008
13 years 7 months ago
2008
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown tha...