HW5Soln

HW5Soln - Homework 5 Solution CSCI 2670 October 6 2005 3.2 c New text q11#1 xq3#1 x#q5#1 qreject Old text q11#1 ~q3#1 ~#q5#1 qreject 3.2 e New text

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
Homework 5 Solution CSCI 2670 October 6, 2005 3.2 c) New text q 1 1##1 xq 3 ##1 x#q 5 #1 q reject Old text q 1 1##1 ~q 3 ##1 ~#q 5 #1 q reject 3.2 e) New text q 1 10#10 xq 3 0#10 x0q 3 #10 x0#q 5 10 x0q 6 #x0 xq 7 0#x0 q 7 x0#x0 xq 1 0#x0 xxq 2 #x0 xx#q 4 x0 xx#xq 4 0 xx#q 6 xx xxq 6 #xx xq 7 x#xx xxq 1 #xx xx#q 8 xx xx#xq 8 x xx#xxq 8 ~ xx#xxq accept Old text q 1 10#10 ~q 3 0#10 ~0q 3 #10 ~0#q 5 10 ~0#1q 5 0 ~0#10q 5 ~
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
~0#1q 7 0 ~0#1q 7 0 ~0#q 7 10 ~0q 7 #10 ~q 7 0#10 q 7 ~0#10 ~q 9 0#10 ~0q 9 #10 ~0#q 11 10 ~0q 12 #x0 ~q 12 0#x0 q 12 ~0#x0 ~q 13 0#x0 ~xq 8 #x0 ~x#q 10 x0 ~x#xq 10 0 ~x#q 12 xx ~xq 12 #xx ~q 12 x#xx q 12 ~x#xx ~q 13 x#xx ~xq 13 #xx ~x#q 14 xx ~x#xq 14 x ~x#xxq 14 ~ ~x#xxq accept ~ 3.6 The problem is that M may not halt on some string s k . If that is the case, then E will never enumerate any string s i with i > k. 3.8 b) If first symbol is a 0 Write $ and move right until the next 0 If end of string is reached reject Write X and move left until $ Move right until there the next 1 If end of string is reached reject Write X and move left until $ Else if first symbol is a 1 Write $ and move right until the next 0 If end of string is reached reject Move right until there the next 0 If end of string is reached reject Write X and move left until $ Else (first symbol must be ~) accept Repeat
Background image of page 2
Move right until the next 1 If end of string is reached Move left until $ Move right until next 0 If end of string is reached accept Else reject Write X and move left until $ Move right until next 0 If end of string is reached reject Write X and move right until next 0 If end of string is reached reject Move left until $ 3.12) We need to simulate a {R,RESET} Turing machine using a standard Turing machine and vice versa. First, lets assume we have a {R,RESET} machine M and
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/07/2011 for the course CS 501 taught by Professor Sm during the Spring '11 term at Indiana.

Page1 / 5

HW5Soln - Homework 5 Solution CSCI 2670 October 6 2005 3.2 c New text q11#1 xq3#1 x#q5#1 qreject Old text q11#1 ~q3#1 ~#q5#1 qreject 3.2 e New text

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online