The Behaviour and Simplicity of Finite Moore Automata

This book was written primarily to research mathematicians who are interested in theoretical computer science and its connections with algebra and combinatorial theory. Similarly to other branches of theoretical computer science, the theory of (Mealy-type and Moore-type) automata is a basis of the technical achievements of computer science. Thus the present book may be useful for scientists working in a certain practical field.