This assignment is also due 5 December.
Miminize the number of states needed to implement the following Mealy machine.
| Present State | Input | Next State | Output |
|---|---|---|---|
| A | 0 | A | 0 |
| A | 1 | B | 0 |
| B | 0 | C | 0 |
| B | 1 | D | 0 |
| C | 0 | E | 0 |
| C | 1 | F | 0 |
| D | 0 | G | 1 |
| D | 1 | H | 0 |
| E | 0 | A | 0 |
| E | 1 | B | 0 |
| F | 0 | C | 0 |
| F | 1 | D | 0 |
| G | 0 | E | 0 |
| G | 1 | F | 0 |
| H | 0 | G | 1 |
| H | 1 | H | 0 |
Using the techniques discussed in class on 21 November, transform the following non-deterministic finite string recognizer, where S is the starting state and A is the accepting (1-output) state, into a deterministic finite string recognizer.
| Present State | Input | Next State |
|---|---|---|
| S | 0 | S |
| S | 0 | T |
| S | 1 | S |
| T | 1 | U |
| U | 0 | A |
| A | 0 | A |
| A | 1 | A |