Consider the regular language L =(111+11111)*. The minimum number of states

M

Mr. Dubey

🎓 Coach ⭐ 102.92K Points

📊 Theory of Computation and Compiler Design

Q. Consider the regular language L =(111+11111)*. The minimum number of states

(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

👁️

228

Total Visits

📽️

2 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

97%

Success Rate