オートマトン理論再考

Abstract

Automata are the simplest mathematical model of computation, so simple that they take forms in various diverse areas. In this survey, we present several theorems, one of which gives a new viewpoint for the classical theory of automata, and one of which shows a deep relation between formal language theory and other mathematical fields.