Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 13 - Section 13.5 - Turing Machines - Writing Projects - Page 903: 3

Answer

a) The machine halts (and accepts) at the blank following the input, having changed the tape from 11 to 01. b) The machine changes every other occurrence of a 1, if any, starting with the first, to a 0, and otherwise leaves the string unchanged; it halts (and accepts) when it comes to the end of the string.

Work Step by Step

Telling What does the Turing machine described by the fivetuples (s0, 0, s0, 0,R), (s0, 1, s1, 0,R), (s0,B, s2,B,R), (s1, 0, s1, 0,R), (s1, 1, s0, 1,R), and (s1,B, s2,B,R) do when given a) 11 as input ...... The machine halts (and accepts) at the blank following the input, having changed the tape from 11 to 01. --- b) an arbitrary bit string as input .......The machine changes every other occurrence of a 1, if any, starting with the first, to a 0, and otherwise leaves the string unchanged; it halts (and accepts) when it comes to the end of the string.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

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.