Theory of Computation - Regular Language Models
53. A finite state machine with the following state table has a single input x and a single output z
| 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 |
If the initial state is unknown, then shortest input sequence to reach the final state C is
