A simple and practically convenient algorithm of synthesis of finite automats after events represented by them is described in this paper.
The term «finite automat» is taken in the sense of Moore; and the term «event», in the sense of Kleene. As distinct from other algorithms, the synthesis algorithm described is composed so as to represent several events at once.
Citation Example:Glushkov V. M. On an Algorithm of Synthesis of Abstract Automats // Ukr. Mat. Zh. - 1960. - 12, № 2. - pp. 147-156.