The set that can be recognized by a deterministic finite state automaton is

M

Mr. Dubey

🎓 Coach ⭐ 104.48K Points

📊 Theory of Computation

Q. The set that can be recognized by a deterministic finite state automaton is

(A) The set {1, 101, 11011, 1110111, …….}
(B) The set of binary string in which the number of 0’s is same as the number of1’s
(C) 1, 2, 4, 8……2n ….. written in binary
(D) 1, 2, 4, 8……2n ….. written in unary

💬 Discuss

✅ Correct Answer: (C) 1, 2, 4, 8……2n ….. written in binary

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

431

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

89%

Success Rate