The Algebraic Theory of Automata
Mario Dal Cin · 1980
Much scientific work today is directed towards understanding complexity — the complexity of numerical algorithms, of the English syntax, of living organisms or ecological systems, to cite only a few examples. The aim of this chapter is to introduce the reader to the theory of discrete information processing systems (automata) and to develop an algebraic framework within which we can talk about their complexity. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.