Sciweavers

662 search results - page 1 / 133
» Trees, Automata and XML
Sort
View
ADL
2000
Springer
225views Digital Library» more  ADL 2000»
13 years 9 months ago
Using Regular Tree Automata as XML Schemas
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...
Boris Chidlovskii
IPL
2008
147views more  IPL 2008»
13 years 4 months ago
Streaming tree automata
Streaming validation and querying of XML documents are often based on automata for tree-like structures. We propose a new notion of streaming tree automata in order to unify the t...
Olivier Gauwin, Joachim Niehren, Yves Roos
FROCOS
2007
Springer
13 years 10 months ago
Languages Modulo Normalization
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:...
Hitoshi Ohsaki, Hiroyuki Seki
JCSS
2007
107views more  JCSS 2007»
13 years 4 months ago
On the minimization of XML Schemas and tree automata for unranked trees
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...
Wim Martens, Joachim Niehren
CSR
2007
Springer
13 years 10 months ago
Marrying Words and Trees
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
Rajeev Alur