We introduce a new connection between formal language theory and proof theory. One of
the most fundamental proof transformations in a class of formal proofs is shown to …

Words and trees are amongst the most studied structures in computer science. In this thesis,
we focus on words and trees that can contain elements from some infinite alphabet, like for …

We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up
automata on ranked trees with distinguished states called rigid. Rigid states define a …

We introduce the class of rigid tree automata (RTA), an extension of standard bottom-up
automata on ranked trees with distinguished states called rigid. Rigid states define a …

We define tree automata with global constraints (TAGC), generalizing the class of tree
automata with global equality and disequality constraints (TAGED). TAGC can test for …

A tree automaton with global tree equality and disequality constraints, TAGED for short, is an
automaton on trees which allows to test (dis) equalities between subtrees which may be …

We define tree automata with global equality and disequality constraints (TAGED). TAGEDs
can test (dis) equalities between subtrees which may be arbitrarily faraway. In particular …

1.1 Background The XML format, introduced over ten years ago [BPSM+ 08], has become a
de facto standard for data exchange. It is now a common language for various communities …

We define a class of ranked tree automata TABG generalizing both the tree automata with
local tests between brothers of Bogaert and Tison (1992) and with global equality and …

This article is inspired by two works from the early 90s. The first one is by Bogaert and Tison
who considered a model of automata on finite ranked trees where one can check equality …