[PDF][PDF] Tree automata techniques and applications
H Comon, M Dauchet, R Gilleron, F Jacquemard… - 2008 - inria.hal.science
During the past few years, several of us have been asked many times about references on
finite tree automata. On one hand, this is the witness of the liveness of this field. On the other …
finite tree automata. On one hand, this is the witness of the liveness of this field. On the other …
Two-variable logic on data trees and XML reasoning
Motivated by reasoning tasks for XML languages, the satisfiability problem of logics on data
trees is investigated. The nodes of a data tree have a label from a finite set and a data value …
trees is investigated. The nodes of a data tree have a label from a finite set and a data value …
Expressiveness and complexity of XML schema
The common abstraction of XML Schema by unranked regular tree languages is not entirely
accurate. To shed some light on the actual expressive power of XML Schema, intuitive …
accurate. To shed some light on the actual expressive power of XML Schema, intuitive …
Synthesis of data completion scripts using finite tree automata
In application domains that store data in a tabular format, a common task is to fill the values
of some cells using values stored in other cells. For instance, such data completion tasks …
of some cells using values stored in other cells. For instance, such data completion tasks …
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 …
languages. We study the problem of efficiently minimizing such automata. First, we study …
Interactive learning of node selecting tree transducer
We develop new algorithms for learning monadic node selection queries in unranked trees
from annotated examples, and apply them to visually interactive Web information extraction …
from annotated examples, and apply them to visually interactive Web information extraction …
[PDF][PDF] An extension of data automata that captures XPath
We define a new kind of automata recognizing properties of data words or data trees and
prove that the automata capture all queries definable in Regular XPath. We show that the …
prove that the automata capture all queries definable in Regular XPath. We show that the …
[PDF][PDF] Counting in trees.
We consider automata and logics that allow to reason about numerical properties of
unranked trees, expressed as Presburger constraints. We characterize non-deterministic …
unranked trees, expressed as Presburger constraints. We characterize non-deterministic …
Optimizing schema languages for XML: Numerical constraints and interleaving
The presence of a schema offers many advantages in processing, translating, querying, and
storage of XML data. Basic decision problems such as equivalence, inclusion, and …
storage of XML data. Basic decision problems such as equivalence, inclusion, and …
A robust theory of series parallel graphs
Motivated by distributed data processing applications, we introduce a class of labeled
directed acyclic graphs constructed using sequential and parallel composition operations …
directed acyclic graphs constructed using sequential and parallel composition operations …