The automation table describes the state transitions for the corresponding input vectors. The output vectors are directly dependent on the states and are also assigned to them in the representation. The automation table is very similar to the SZM and should therefore also be understood as a basis.
U1 = [E1]; U2=[E2]; U3=[E3];
Y1 = [A1]; Y2 =[A2];
Z1 = [Waiting for key E3]; Z2 = [Move cylinder to position E2]; Z3 = [Waiting for E3 key];
Z4 = [Move cylinder to position E1]
Table 7-3 Moore automaton table for Figure 3-2
The automaton table is suitable for very large automata with many states. For humans, it is easy to see which subsequent state results from an input (Ux). And in which state which output (Yx) occurs. You get a very good overview here if the automaton is fully defined. This is the case if every input can be reacted to in every state. This means that there must not be a ( - ) at any point in the table. If a line of a state is only filled with ( - ), it is a final state. This means that once this state has been reached, it cannot be exited with any input.