1 votes 1 votes Let $\text{M}$ be the $5$-state $\text{NFA}$ with $\epsilon$-transitions shown in the diagram below. Which one of the following regular expressions represents the language accepted by $\text{M}$? $(00)^{*}+1(11)^{*}$ $0^{*}+\left(1+0(00)^{*}\right)(11)^{*}$ $(00)^{*}+\left(1+(00)^{*}\right)(11)^{*}$ $0^{+}+1(11)^{*}+0(11)^{*}$ Theory of Computation gatecse2024-set2 theory-of-computation finite-automata + – Arjun asked Feb 16 • edited Apr 24 by Arjun Arjun 2.5k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes Video Solution: NFA to Regular Expression - GATE CSE 2024Counter-example for option A: $011$ is not generated.Counter-example for option C: $000$ is not generated.Counter-example for option D: empty string is not generated. WHY Option B: See HERE. Deepak Poonia answered Feb 16 Deepak Poonia comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes From Question minimum Empty string is accepted so Option D is eliminated, Also A & C option is restricting for 0's to be in multiple of 2 so A & C eliminated as we can have any multiple of 0 even or odd so Answer is option B ashwinsuthar1 answered Mar 19 ashwinsuthar1 comment Share Follow See all 0 reply Please log in or register to add a comment.
