Sequential logic
Example use case
Christmas tree light
A B C A B C A B C A B C
A B C A B C A B C A B C
A B C A B C A B C A B C
A B C A B C A B C A B C
it feels like the lights are 'running'
| x1 | x2 | action |
|---|---|---|
| 0 | 0 | all off |
| 0 | 1 | ABCABC |
| 1 | 0 | CBABCA |
| 1 | 1 | all on |
Every state is represented by a code. State is updated every clock tick the state is updated based on the current state+code
D-type flip-flop
| Q->Q' | D |
|---|---|
| 0->0 | 0 |
| 0->1 | 1 |
| 1->0 | 0 |
| 1->1 | 1 |
Synchronous Moore automaton
To minimize the automaton, we must find steps which output the same states.
Equivalence of states of automatons
Definition 2
Two states
Initial graph and state transition table
