The wealth of model-based techniques in software engineering—such as model checking or
model-based testing—is starkly contrasted with a frequent lack of formal models in practical …

Accurate description of program inputs remains a critical challenge in the field of
programming languages. Active learning, as a well-established field, achieves exact …

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 …

We study the expressiveness and succinctness of history-deterministic pushdown automata
(HD-PDA) over finite words, that is, pushdown automata whose nondeterminism can be …

Some of the most relevant document schemas used online, such as XML and JSON, have a
nested format. In the past decade, the task of extracting data from nested documents over …

Nested words model data with both linear and hierarchical structure such as XML
documents and program traces. A nested word is a sequence of positions together with a …

We show that problems arising in static analysis of XML specifications and transformations
can be dealt with using techniques similar to those developed for static analysis of …

The minimization problem for visibly pushdown automata (VPA) is studied. Two subclasses
of VPA are introduced: call driven automata, and block automata. For the first class …

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 two …

Earliest query answering (eqa) is an objective of streaming algorithms for XML query
answering, that aim for close to optimal memory management. In this paper, we show that …