UGC NET CSE | December 2012 | Part 3 | Question: 47

Question

The minimum number of states of the non-deterministic finite automaton which accepts the language

$\{ a b a b^n \mid n \geq 0 \} \cup \{ a b a^n \mid n \geq 0 \}$ is

• A. 3
• B. 4
• C. 5
• D. 6

Answer 1

L={ababⁿ∣n≥0}∪{abaⁿ∣n≥0} 

L={ab, aba , abaa  ,abab  ,ababb,..........}

The minimum number of states of the non-deterministic finite automaton which accepts the language =5

Hence,Option(c)5 is the correct choice.

Comments

Praveen Saini  Sir please check  this

---

yes now it is correct update in answer

---

Thank You sir

Answer 2

answer : 4

Correct me if I am wrong

Comments

ok I got it in case of NFA it is fine

---

Yes, This NFA wrongly accepts the string abaaaaabbb.. which does not belong to L

Answer is wrong

---

@sh!va thanks your point makes a difference here  now i got it