a) Construct Minimum State automata equivalent to FA. | State | 0 | 1…

Question

a) Construct Minimum State automata equivalent to FA.

| State | 0 | 1 |

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

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

| $q_1$ | $q_0$ | $q_2$ |

| $q_2$ | $q_3$ | $q_1$ |

| $q_3$ | $q_3$ | $q_0$ |

| $q_4$ | $q_3$ | $q_5$ |

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

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

| $q_7$ | $q_6$ | $q_3$ |

b) State and Prove Pumping Lemma for Regular Sets?

Related pages

• Pumping Lemma of Regular Sets — topic
• Theory of Computation syllabus

More PYQs on Pumping Lemma of Regular Sets

• a) Prove that there exists no finite state machine that accepts palindrome? b) Show that $L = \{0^i 1^i \mid i \ge 1\}$ is not regular?
• Write down the Pumping Lemma for regular sets. How is it used to prove that a language is not regular ? Using Pumping Lemma prove that $L = \{a^w \mid w = 2^n…