Overview
XML has been widely accepted, and many new technologies (e.g.,
query languages, schema languages, programming languages) for XML have
been and are still being developed. Unfortunately, XML does not have
a formal model on top of which such new technologies can be safely built.
We believe that the hedge automaton theory provides a powerful and
unified foundation of such languages. A hedge is an ordered
sequence of ordered trees. A hedge automaton is a variation
of tree automata for hedges. Given a hedge, a hedge automata assings
states nodes in the hedge, and finally report whether the hedges is
accepted or not. More about hedge automata, see
Hedge automata: a formal model for XML schemata and SGML/XML and Forest/Hedge Automata Theory
of the XML Cover Pages.
Research topics
- Hedge automata
- Hedge regular expressions
- Binarization, deteriminization, minimization
- XSLT type inference
- Comparison of XML schema languages
- Extended path expressions
External publication
|
