NOTES ON MATHEMATICAL AUTOMATA THEORY
J. W. Thatcher · Defense Technical Information Center (DTIC) · 1963
A discussion is presented of the formulation of the concept of finite automation in terms of monadic algebras. In considering the theory of the structure of finite automata (as opposed to the behavior), the set of final states can be dropped from the definition. Here, results from the study of abstract algebras yield directly, for example, the decomposition theorems for finite automata. The purpose of these notes is to present some of the basic concepts and results of finite automata theory within this algebraic framework. (Author)