Q. Which of the following assertions about Turing Machines is true? Blank symbol(s) may occur in the input. At any stage of a computation, there are only finitely many non-blank Symbols on the tape. (Solved)

1. Assertions (a) and (b) are both true.

2. Neither (a) nor (b) is true.

3. Both False

4. None of above

  • c. Both False
Subscribe Now

Get All Updates & News