Regular Processing

In this practice is about compute an automaton and generate the synthetize for the regexp in Figure 1.

Figure 1.

After have a deterministic version of the automaton corresponding the regeexp on figure 1, the automaton will implement with the following design, the system states will be coded as non-negative integers, the sequence of events will be presented as a standard string, the indefiniteness of a state will be coded as -1.

The synthesis of the regexp