… We consider deterministic root-to-frontier (DR) tree recognizers and the tree languages
recognized by them from an algebraic point of view. We make use of a correspondence between …

… ideas of automata as algebras tree automata once emerged. … field ever since its publication
in 1984. Unfortunately, it has long … Akad�miai Kiad�, the original publisher, did not find the …

… tree-automaton defining a given regular tree language L as some quotient of any deterministic
tree-automaton … Since the polynomial system associated with a quotient-automaton is a …

… of a tree in T to its leaves labeled with a given leaf symbol. The Nerode path congruence of
a tree … We prove a Nerode-like theorem for DR tree languages and show how Nerode path …

… weighted tree automata … trees is quite similar to the weighted logic for words [18]. Assuming
familiarity with the unweighted logics for trees, background results on weighted tree automata…

… The algebra d may be regarded as a tree automaton, and then tw” is the state in which &
reaches the root of t when started at any x-labelled leaf in state xc( for each x in X. This suggests …

… ABSTRACT We consider tree automata with costs over semirings … tree automata with costs
over finitely factorizing and monotonic semirings is decidable. We show that, for tree automata …

… A pair of a finite tree automaton and a cost function is called a cost automaton. There are
two … A generated tree automaton A is meant to traverse the abstract syntax tree of an input …

… We investigate automata networks as algebraic structures … almost exclusively to finite
automata networks (with notable … are only finitely many component automata in the network (ie…

… In Section 1, we introduce our basic notation concerning trees and tree automata. In Section
2, we introduce semirings, our notation concerning polynomials over semirings and cost …