# Chapter 12 - 12.5 - Turing Machine Examples - Practice Problems - Page 607: 1

\begin{array}{l}{\text { It is not equivalent. There is no transition from State } 1 \text { for an input }} \\ {\text { symbol of } 0, \text { and no transition from State } 2 \text { for an input symbol of } 1 .}\end{array}

#### Work Step by Step

\begin{array}{l}{\text { It is not equivalent. There is no transition from State } 1 \text { for an input }} \\ {\text { symbol of } 0, \text { and no transition from State } 2 \text { for an input symbol of } 1 .}\end{array}

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.