Q. Let n be the positive integer constant and L be the language with alphabet {a}. To recognize L the minimum number of states required in a DFA will be

(A) 2k + 1
(B) k + 1
(C) 2n + 1
(D) n + 1

💬 Discuss

✅ Correct Answer: (D) n + 1

Published by Mr. Dubey ⭐ 111.54K Points at 18-Sep-2023 04:33 pm in Theory of Computation

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

575

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

85%

Success Rate