Automaton with Various States
Traditional finite state automata only have three types of states: begin, accept, and normal.
From now on, we will have various state types for different levels. The below picture shows an example.

In this example, states 2, 3, and 4 are used to accept "a," "b," and "c," respectively.
Changed files in this update