Construct a Minimum State Automata equivalent to the FA whose transit…

Previous year question for Theory of Computation.

Question

Construct a Minimum State Automata equivalent to the FA whose transition table is as shown :

| | 0 | 1 |

|---|---|---|

| $\rightarrow q_0$ | $q_1$ | $q_5$ |

| $q_1$ | $q_6$ | $q_2$ |

| $(q_2)$ | $q_0$ | $q_2$ |

| $q_3$ | $q_2$ | $q_6$ |

| $q_4$ | $q_7$ | $q_5$ |

| $q_5$ | $q_2$ | $q_6$ |

| $q_6$ | $q_6$ | $q_4$ |

| $q_7$ | $q_6$ | $q_2$ |