During the past few years, several of us have been asked many times about references on
finite tree automata. On one hand, this is the witness of the liveness of this field. On the other …

The theory of tree automata and tree languages emerged in the middle of the 1960s quite
naturally from the view of finite automata as unary algebras advocated by JR Biichi and JB …

This paper surveys some techniques and tools for achieving reachability analysis over term
rewriting systems. The core of those techniques is a generic tree automata completion …

On a case study, we present a new approach for verifying cryptographic protocols, based on
rewriting and on tree automata techniques. Protocols are operationally described using …

We present here decidable approximations of sets of descendants and sets of normal forms
of Term Rewriting Systems, based on specific tree automata techniques. In the context of …

We present a collection of results on regular tree languages and rewrite systems. Moreover
we prove the undecidability of the preservation of regularity by rewrite systems. More …

Right-linear finite path overlapping TRS are shown to effectively preserve recognizability.
The class of right-linear finite path overlapping TRS properly includes the class of linear …

We define different types of bottom-up tree pushdown automata and study their connections
with rewrite systems. Along this line of research we complete and generalize the results of …

We introduce the notion of the generalized semi-monadic rewrite system, which is a
generalization of well-known rewrite systems: the ground rewrite system, the monadic …

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 …