Theory of computations

An Introduction to formal language and automata 6th edition.

Chapter 10: other models of turing machines

Solve the following questions.

Please solve it clearly

use Keyboard not hand writtin answers.

Thank you.

3. Do Exercise 7 of Section 10.1 at page 267. 7 Consider a Turing machine that cannot write blanks; that is, for all (qi, a b, L or R), b must be in I' t. Show how such a machine can simulate a standard Turing machine