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 …

We survey some important results for weighted tree automata and weighted tree transducers
over finite ranked trees and semirings as weight structure. In particular, we address closure …

This result generalizes in a straightforward way to automata on finite trees. I rediscovered
this generalization in connection with work on finitely presented algebras, and stated it …

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 …

In this paper we prove a Myhill-Nerode theorem for recognizable tree series over
commutative semifields and thereby present a minimization of bottom-up finite state …

We devise a learning algorithm for deterministically recognizable tree series where the
weights are taken from a commutative group. For this, we use an adaptation of the minimal …

A tree language is congruential if it is the union of finitely many classes of a finitely
generated congruence on the term algebra. It is well known that congruential tree languages …

A ground term rewriting system is a term rewriting system for which the rules do not contain
variables. We will show that a natural concept of derivation tree can be defined for these …

It is well known that congruential tree languages are the same as recognizable tree
languages. In this paper we construct, in O (n log n) time, for a given ground term equation …