The minimum state automaton equivalent to the above FSA has the following number of states

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Theory of Computation and Compiler Design

Q. The minimum state automaton equivalent to the above FSA has the following number of states

(A) 1
(B) 2
(C) 3
(D) 4

💬 Discuss

✅ Correct Answer: (B) 2

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

143

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

91%

Success Rate