The synthesis of an abstract automaton with respect to an event which can be represented by it on an electronic digital machine

TLDR: The synthesis algorithm carried out the successive transformation of the regular expression into an expression which is presented as the columns of the transition table of the automaton, written down one after the other (starting from the first).

Abstract: The problem is to construct the transition table of an automaton which represents an event from the regular notation of this event [1], [2]. The synthesis algorithm carried out the successive transformation of the regular expression into an expression which is presented as the columns of the transition table of the automaton, written down one after the other (starting from the first). The algorithm includes the following operators. Operator I looks for the letters in the regular notation of the event.