ABSTRACT
We shall drop th e word "generalized" for the res t of this section, as this is the notion we shall be exclusively dealing with. Thus, we h ave the category srf-Aut of stf-automata. The bimodule 3 gives n - tup les of trees ( terms) and the bimodule T provides operations to be performed on these trees. As we did in §1, we can define the b eh av io u r of (X,3,T) in t e r m s of bimodule composition.
