6
A finite state machine with the following state table has a single input x and a single output z. If initial state is unknown, then shortest input sequence to reach the final state C is
| Present state | Next state, z | |
| X = 1 | X =0 | |
| A | D, 0 | B, 0 |
| B | B, 1 | C, 1 |
| C | B, 0 | D, 1 |
| D | B, 1 | C, 0 |
