πŸ“Š Theory of Computation
Q. In which of the stated below is the following statement true? “For every non-deterministic machine M1, there exists as equivalent deterministic machine M2 recognizing the same language.”
  • (A) m1 is a non-deterministic finite automata
  • (B) m1 is a non-deterministic push-down automata
  • (C) m1 is a non-deterministic turing machine
  • (D) for no machine m1 use the above statement true
πŸ’¬ Discuss
βœ… Correct Answer: (C) m1 is a non-deterministic turing machine

You must be Logged in to update hint/solution

πŸ’¬ Discussion

πŸ“Š Question Analytics

πŸ‘οΈ
887
Total Visits
πŸ“½οΈ
3 y ago
Published
πŸŽ–οΈ
Mr. Dubey
Publisher
πŸ“ˆ
98%
Success Rate