Products of automata and the problem of covering
Abraham Ginzburg, Michael Yoeli · Transactions of the American Mathematical Society · 1965
Abstract : Convenient relational techniques for the description and study of complete or partial, finite or infinite automata is introduced. By associating with every input two binary relations an easy and concise algebraic method for the study of homomorphisms and covering of automata is obtained. (Author)