Download full version in PDF-format (182Kb)
Finite automata, which in the past were mainly used in hardware, are presently finding extensive application in programming. In this paper, we outline the basic algorithmization and programming principles for logic control and "reactive" systems, regarding programs as finite automata. Besides the traditional fields of application, such as compiler design, finite automata are presently used in programming programmable logic (PL) controllers, describing the behavior of certain objects in object-oriented programming, as well as in programming protocols, games, and PL circuitry. We would like to dispel the misbelief that "automata are becoming obsolete" and show they are just beginning to find extensive application in programming.
Algorithmization and programming principles for logic control and "reactive" systems are formulated, regarding algorithms and programs as finite automata. The application of finite automata to programming for other problems is also reviewed.