Scribd
Upload
17 views

Rosen 7 e Extra Examples 1305

download pdf and click the button to see solution

Uploaded by

Bijay Nag
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
17 views

Rosen 7 e Extra Examples 1305

download pdf and click the button to see solution

Uploaded by

Bijay Nag
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Show All Solutions

Rosen, Discrete Mathematics and Its Applications, 7th edition


Extra Examples
Section 13.5—Turing Machines

— Page references correspond to locations of Extra Examples icons in the textbook.

p.889, icon at Example 1


#1. Let T be the Turing machine defined by these five-tuples:
(s0 , 0, s1 , 1, R), (s0 , 1, s0 , 0, R), (s0 , B, s1 , 0, R), (s1 , 0, s0 , 0, R), (s1 , 1, s2 , 0, R), (s1 , B, s2 , 1, L).
If T is run on the following tape, beginning in initial position, what is the final tape when T halts?

··· B B 0 1 B 1 1 B B ···

See Solution
Solution:
Beginning with the above tape, we obtain the following sequence of tapes, ending with the last tape in the
sequence:
s0
↓
··· B B 0 1 B 1 1 B B ···
s1
↓
··· B B 1 1 B 1 1 B B ···
s2
↓
··· B B 1 0 B 1 1 B B ···
Machine halts.

p.889, icon at Example 1


#2. Let T be the Turing machine defined by these five-tuples:
(s0 , 0, s1 , 1, R), (s0 , 1, s0 , 0, R), (s0 , B, s1 , 0, R), (s1 , 0, s0 , 0, R), (s1 , 1, s2 , 0, R), (s1 , B, s2 , 1, L).
If T is run on the following tape, beginning in initial position, what is the final tape when T halts?

··· B B 1 B 0 1 0 B B ···

See Solution
Solution:
Beginning with the above tape, we obtain the following sequence of tapes, ending with the last tape in the
sequence:
s0
↓
··· B B 1 B 0 1 0 B B ···
s0
↓
··· B B 0 B 0 1 0 B B ···
s1
↓
··· B B 0 0 0 1 0 B B ···
s0
↓

1
··· B B 0 0 0 1 0 B B ···
s0
↓
··· B B 0 0 0 0 0 B B ···
s1
↓
··· B B 0 0 0 0 1 B B ···
s2
↓
··· B B 0 0 0 0 1 1 B ···
Machine halts.

p.889, icon at Example 1


#3. Let T be the Turing machine defined by these five-tuples:
(s0 , 0, s1 , 1, R), (s0 , 1, s0 , 0, R), (s0 , B, s1 , 0, R), (s1 , 0, s0 , 0, R), (s1 , 1, s2 , 0, R), (s1 , B, s2 , 1, L).
If T is run on the following tape, beginning in initial position, what is the final tape when T halts?

··· B B 0 0 0 1 0 B B ···

See Solution
Solution:
Beginning with the above tape, we end with the following tape:
s2
↓
··· B B 1 0 1 0 0 B B ···

p.889, icon at Example 1


#4. Let T be the Turing machine defined by these five-tuples:
(s0 , 0, s1 , 1, R), (s0 , 1, s0 , 0, R), (s0 , B, s1 , 0, R), (s1 , 0, s0 , 0, R), (s1 , 1, s2 , 0, R), (s1 , B, s2 , 1, L).
If T is run on the following tape, beginning with the third blank from the left, what is the final tape when
T halts?

··· B B B B B B B B B ···

See Solution
Solution:
Beginning with the above tape, we end with the following tape:
s2
↓
··· B B 0 1 B B B B B ···

You might also like