1.1.1.1 Class 0 – Combinatorial Logic

Class 0 state machines generate outputs based solely on their inputs. The portion of the general state machine included in Class 0 is shown with solid lines in Figure 1-2. The output expression is represented as follows:

$I=f\left[Q\right]$

Any combinatorial logic circuit is an example of a Class 0 state machine. A specific example could be a 4-input look-up table implementation, where the output is determined by the four inputs to the look-up table.