Geodesic
Finite Automata Accepting Animals and Lower Sets
Séminaire lotharingien de combinatoire, Tome 13 (1985)

Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website

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 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. 
@article{SLC_1985_13_a11,
     author = {Helmut Sperber},
     title = {Finite {Automata} {Accepting} {Animals} and {Lower} {Sets}},
     journal = {S\'eminaire lotharingien de combinatoire},
     publisher = {mathdoc},
     volume = {13},
     year = {1985},
     url = {http://geodesic.mathdoc.fr/item/SLC_1985_13_a11/}
}
TY  - JOUR
AU  - Helmut Sperber
TI  - Finite Automata Accepting Animals and Lower Sets
JO  - Séminaire lotharingien de combinatoire
PY  - 1985
VL  - 13
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SLC_1985_13_a11/
ID  - SLC_1985_13_a11
ER  - 
%0 Journal Article
%A Helmut Sperber
%T Finite Automata Accepting Animals and Lower Sets
%J Séminaire lotharingien de combinatoire
%D 1985
%V 13
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SLC_1985_13_a11/
%F SLC_1985_13_a11
Helmut Sperber. Finite Automata Accepting Animals and Lower Sets. Séminaire lotharingien de combinatoire, Tome 13 (1985). http://geodesic.mathdoc.fr/item/SLC_1985_13_a11/