Partially ordered classes of finite automata

This paper is concerned with the algebraic structure of classes of automata, rather than single automata, with respect to several relations on these classes: certain equivalence relations like isomorphism and having identical semigroups, and certain partial order relations like being a homomorphic image or a subautomaton of another automaton. Several classes of automata are found to be lattices under certain partial orders.