We collect evidence to answer the following question: Is the quality of the XML documents
found on the web sufficient to apply XML technology like XQuery, XPath and XSLT? XML …

It is well known that for a given bottom-up tree automaton it can be decided whether or not
an equivalent deterministic top-down tree automaton exists. Recently it was claimed that …

We study the descriptional complexity of regular languages that are definable by
deterministic regular expressions, ie, we examine worst-case blow-ups in size when …

This dissertation synthesizes research in abstract algebra, computer science, and linguistics
to better characterize properties of natural languages. The first contribution is a thorough …

We prove that various containment and validity problems for tree pattern queries with
respect to a schema are EXPTIME-complete. When one does not require the root of a tree …

It is well known that for a regular tree language it is decidable whether or not it can be
recognized by a deterministic top-down tree automaton (DTA). However, the computational …

We study the descriptional complexity of regular languages that are definable by
deterministic regular expressions. First, we examine possible blow-ups when translating …

We study the problem of, given a corpus of XML documents and its schema, finding an
optimal (generative) probabilistic model, where optimality here means maximizing the …

To experimentally validate learning and approximation algorithms for XML Schema
Definitions (XSDs), we need algorithms to generate uniformly at random a corpus of XSDs …

It is well known that for a given bottom-up tree automaton it can be decided whether or not
there exists deterministic top-down tree automaton that recognized the same tree language …