πŸ“Š Theory of Computation
Q. Which statement is true?
  • (A) The tape of turing machine is infinite.
  • (B) The tape of turing machine is finite.
  • (C) The tape of turing machine is infinite when the language is regular
  • (D) The tape of turing machine is finite when the language is nonregular.
πŸ’¬ Discuss
βœ… Correct Answer: (A) The tape of turing machine is infinite.

You must be Logged in to update hint/solution

πŸ’¬ Discussion

πŸ“Š Question Analytics

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