This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: <if stmt>  <if stmt> else <stmt> <if stmt> → <if clause> <uncond stmt> <if clause> → if boolexpr then Exercise 5 In class we introduced a type of Turing Machine whose tape is twoway inﬁnite, which means the machine can keep moving left or right indeﬁnitely. Also the action that the machine can take is one of { L,R,N } . In the book, the deﬁnition is slightly diﬀerent. The tape of the Turing Machine is oneway inﬁnite, which means there is a leftmost square of the tape and the machine cannot move left when at that position. In addition, the action the machine can take is one of { L,R } . You task is to prove that a Turing Machine of the type deﬁned in the textbook can simulate a Turing Machine of the type deﬁned in class. Exercise 6 (Bonus) Prove that any contextfree language over alphabet size 1, for example Σ = { 1 } , is also regular language. Page 2...
View
Full Document
 Spring '09
 EdmundM.Clarke
 Contextfree grammar, uncond stmt

Click to edit the document details