134 search results - page 2 / 27 » Automata for XML - A survey |
FROCOS
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them:...
JAC
2008
13 years 7 months ago
2008
This reading guide aims to provide the reader with an easy access to the study of universality in the field of cellular automata. To fulfill this goal, the approach taken here is o...
RTA
2010
Springer
13 years 9 months ago
2010
Springer
Data words and data trees appear in verification and XML processing. The term “data” means that positions of the word, or tree, are decorated with elements of an infinite set...
SIGMOD
2002
ACM
14 years 5 months ago
2002
ACM
AMW
2011
12 years 9 months ago
2011
Since navigational aspects of XPath correspond to first-order definability, it has been proposed to use the analogy with the very successful technique of translating LTL into aut...