This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: b, R Y → Y, R a → Y, L a → a, L b → b, L Y → Y, L X → X, R as per our convention, we assume it goes to the reject state. 1. Give the formal deﬁnition of M as a tuple. [3 points] 2. Describe each step of the computation of M on the input baabab as a sequence of instantaneous descriptions. [3 points] 3. Describe the language recognized by M . Give an informal argument that outlines the intuition behind the algorithm used by M justiﬁes your answer. [4 points] . 1 Problem 2 . [Category: Design] For Σ = { B , # ,a,b } , design a Turing machine to recognize the language L = { B a 2 n # b n  n ≥ } Note: By deﬁnition B a # ∈ L . You need not prove that your construction is correct, but you must clearly explain the intuitions behind your construction. [10 points] Problem 3 . [Category: Comprehension+Proof] Solve problem 3.13. [10 points] 2...
View
Full Document
 Fall '08
 Viswanathan,M
 #, reject state

Click to edit the document details