Séminaire Lotharingien de Combinatoire, B13l (1986), 6 p.
[Formerly: Publ. I.R.M.A. Strasbourg, 1986, 316/S-13, p. 105-106.]
Helmut Sperber
Finite Automata Accepting Animals and Lower Sets
Abstract.
We consider finite automata which are equipped with n-ary transfer
relations. Such automata can operate on very general structures.
The action on (labelled) trees has widely been
investigated. The well known constructions and results of (string)
automata theory neatly carry
over to tree automata. Our interest is in the operation on
(labelled) structures embedded in u»n, the so-called (directed)
animals, which can be thought of as a "commutative version" of
(regular) trees.
The following version is available:
The main part of the
results of this paper have appeared in the article "On the solutions of a
matrix equation," Boll. Un. Mat. Ital. 3-A (1989), 137-145.