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: 5

Answer

a) Halts with 01 on the tape, and does not accept b) The first 1 (if any) is changed to a 0 and the others are left alone. The input is not accepted.

Work Step by Step

Telling What does the Turing machine described by the five tuples (s0, 1, s1, 0,R), (s1, 1, s1, 1,R), (s1, 0, s2, 0,R), (s2, 0, s3, 1,L), (s2, 1, s2, 1,R), (s3, 1, s3, 1,L), (s3, 0, s4, 0,L), (s4, 1, s4, 1,L), and (s4, 0, s0, 1,R) do when given a) 11 as input .... -a) Halts with 01 on the tape, and does not accept b) a bit string consisting entirely of 1s as input ..... b) The first 1 (if any) is changed to a 0 and the others are left alone. The input is not accepted.
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.