Consider the regular language L =(111+11111)*. The minimum number of states in any DFA accepting this languages is:

M

Mr. Dubey

🎓 Coach ⭐ 104.60K Points

📊 Theory of Computation

Q. Consider the regular language L =(111+11111)*. The minimum number of states in any DFA accepting this languages is:

(A) 3
(B) 5
(C) 8
(D) 9

💬 Discuss

✅ Correct Answer: (D) 9

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

167

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

86%

Success Rate