Definition of a language L with alphabet {a} is given as following. L= { a^{nk} | k > 0, and n is a positive integer constant} What is the minimum number of states needed in a DFA to recognize L?

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Theory of Computation and Compiler Design

Q. Definition of a language L with alphabet {a} is given as following. L= { a^{nk} | k > 0, and n is a positive integer constant} What is the minimum number of states needed in a DFA to recognize L?

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

💬 Discuss

✅ Correct Answer: (B) n+1

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

997

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

80%

Success Rate