This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: (a) 00 (b) 000111 1 (c) 00111 3. (6 points) The following is a state diagram for a nondeterministic Turing machine with input alphabet Σ = { , 1 } , tape alphabet Γ = { , 1 , } , accept state C . C B A → 1 ,R → R 1 → ,R → R 1 → R → L 1 → L Write the conﬁgurations that this TM reaches for the following inputs. For each input, state also whether it is accepted by the TM, rejected by the TM or causes the TM to loop. (Since nondeterminism is involved, you should indicate branching with a tree.) (a) 0001 . (b) 010 . (c) 0110 . 4. (5 points) Consider the language L = { w  w contains the same number of s as 1 s } over the alphabet { , 1 } . Design a deterministic Turing machine for that recognizes L . (a) Give implementationlevel descriptions of your TM. (b) Draw the state diagram for your TM. — End — 2...
View
Full Document
 Spring '10
 H.F.
 Computer Science, Alan Turing, Nondeterministic Turing machine, Probabilistic Turing machine

Click to edit the document details