This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CSCI 2670 Introduction to Theory of Computing October 6, 2005 October 6, 2005 2 Agenda Yesterday Variants of Turing machines Allow stay put state Multiple tapes Today Quick revisit of multiple tapes Nondeterminism Prove equivalence of deterministic and nondeterministic Turing machines Enumerators Prove equivalence of enumerators and deterministic Turing machines October 6, 2005 3 Announcements Homework due next Tuesday 3.7, 3.15 b &amp; c, 3.16 d 3.7 and 3.15 are same in both texts 3.16 d Show the collection of Turingrecognizable languages is closed under the operation of intersection. October 6, 2005 4 Corollary Corollary: A language is Turingrecognizable if and only if some multitape Turing machine recognizes it. October 6, 2005 5 Example Using 2tape Turing machine, write a copy machine Copy tape 1 to tape 2 Move tape 1 to beginning Copy tape 1 to tape 2 Accept October 6, 2005 6 Copy machine {a,~} {x,a},{R,R} {b,~} {y,b},{R,R} {~,~} {L,L} q accept ~,~ {L,S} {x,~} {a,a},{R,R} {y,~} {b,b},{R,R} {~ ,~} {R,R} q reject {a,~} {a,a},{R,R} {b,~} {b,b},{R,R} {a,~} {L,S} {b,~} {L,S} {a,~} {a,a},{R,R} {b,~} {b,b},{R,R} October 6, 2005 7 Copy machine a x,R b y,R ~...
View
Full Document
 Spring '11
 sm
 Nondeterministic Turing Machines, nondeterministic Turing machine, nondeterministic Turing

Click to edit the document details