Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times larger than theâ€¦ (More)

Implementations that load XML documents and give access to them via, e.g., the D OM, suffer from huge memory demands: the space needed to load an XML docu ment is usually many times larger than theâ€¦ (More)

One-counter automata (OCA) are pushdown automata which operate only on a unary stack alphabet. We study the computational complexity of model checking compu tation tree logic ( CTL) on transitionâ€¦ (More)

Motivation In general, computational problems become harder, when inputs are represented in a compressed form. Motivation In general, computational problems become harder, when inputs are representedâ€¦ (More)

Larsson and Moffat's RePair algorithm is generalized from strings to trees. The new algorithm (TreeRePair) produces straight-line linear context-free tree (SLT) grammars which are smaller than thoseâ€¦ (More)

We study satisfiability and infinite-state model checking in ICPDL, which extends Propositional Dynamic Logic (PDL) with intersection and converse operators on programs. The two main results of thisâ€¦ (More)

We study the notion of safe realizability for high-level message sequence charts (HMSCs) (Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP 2001), Creteâ€¦ (More)

We consider a compressed form of the word problem for finitely presented monoids, where the input consists of two compressed representations of words over the generators of a monoid M, and we askâ€¦ (More)