Slides

A robust extension of omega-regular languages (Logic and Algorithms, Edinburgh 08)

Piecewise testable tree languages (LICS 08)

Tree languages definable with one quantifier alternation (ICALP 08)

XPath evaluation in linear time (PODS 08)

Effective characterizations of tree logis (PODS 08 tutorial)
[space moves to next slide, right arrow advances current slide]

Common fragment of ACTL and LTL (FoSSaCS 08)

Forest expressions (CSL 07)

Unary two-way temporal logic for trees (LICS 07)

Expressive power of tree logics (LCC 07)

Unions of commutative rewriting systems (STACS 07)

Data trees (PODS 06)

Data words (LICS 06)

Tree-walking automata (Workshop on tree automata 06)