The theory of formal languages and the theory of automata were both initiated in the late 1950s, explains Ito (Kyoto Sangyo U., Japan), and the two fields have since developed into important theoretical foundations of computer science. He looks at the two from the algebraic perspective, beginning with the algebraic structure of automata, and partially ordered sets of automata as a kind of global theory. Then he delves into grammars, languages, and operations on languages. To conclude, he introduces directable automata as a special case.