The author introduces the concept of some generalized operation on
events, called superposition, and proves the theorem: the superposition of
represented events is another represented event. It is shown that many known
operations on events are special cases of superposition and, consequently,
the corresponding theorems of synthesis are consequences of the theorem of
superposition. A language is introduced for describing represented events,
which makes it possible to establish a connection between the language of
regular expressions and the language proposed by Y. T. Medvedev. This is
used for a new interpretation of V. M. Glushkov's algorithm of abstract synthesis.
Citation Example:Bodnarchuk S. V. Automata and events // Ukr. Mat. Zh. - 1962. - 14, № 4. - pp. 351-361.