Dear Sir/Madam,
Please find the solution in below images.
Thank you and all the best.:)
With Regards,
Yoganjula Reddy G.
I need C and D please 2. Let M be the Turing machine defined by ,...
I'm not sure how to answer this problem. Can someone help me with this. thanks 5. Let M be the Turing machine BIBR 9 9 ala R a) Give a regular expression for L(M. b) Using the techniques from Theorem 10.1.3, give the rules of an unrestricted gram- mar G that accepts L(M. c) Trace the computation of M when run with input bab and give the corresponding derivation in G. 5. Let M be the Turing machine BIBR 9...
7. (Exercise 8.5.1) Simulating a Turing machine. Here is a description of a Turing machine. The input alphabet is {a, b}. The state set is: {90, 91, 92, 93, 94, qacc, Cre; } The transition function is given in the table below: 90 9 42 93 94 a (qı, a, R) (qı, a, R) (q2, a, R) (qace, a, R) (qej, a, R) b (q2, b, R) (qı, b, R) (qı, b, R) (qrej, b, R) (qace, b, R) **...
Third time posting, can someone answer please. Question 2. Consider the Turing machine defined as follows. input alphabet {1} Tape alphabet = { 1,0, x,□} where □ represents a blank Set of states (A, B, C, D Initial state A set of accept states = {D} Transition function: 6(A, z) = (A,z, R) 6(A, □)-(C,D, L) (i) Draw a transition graph for this Turing machine. (ii) Determine the output of the Turing machine for each of the following input i)...
40 points) Please design a Turing machine T to recognize the union of the languages of two Turing machines Mi and M2. That is, T accepts an input string w, if and only if either Mi or M2 or both accept string w. Please describe the high-level idea (or algorithm) of your Turing machine T. You do not need to draw the low-level state transition diagram of your Turing machine. Note that the difficulty is that Mi or M2 may...
3. Let L-{(M, q》 | M is a Turing machine and q is a state in M such that: there is at least one input string w such that M executed on w enters state q). Side note: In the real world, you can think of this as a question about finding "dead code" in a program. The question is: for a given line of code in your program, is there an input that will make the program execute that...
State diagrams for Turing Machines. Suppose you are given a string w ∈ {0,1}* placed on a Turing Machine tape. Give the state diagram for the Turing Machine required to take the initial string, w, and replace it on the tape with a new string, w′. The new string, w′, is formed by shifting the entire input string one cell to the right. Suppose you are given a string w ∈ {0, 1}* placed on a Turing Machine tape. Give...
s S s 1 S S 2. (10 Points) We wish to construct a Turing Machine M (Q,E,F, 8, 8, qaccept, Greject) that decides the language L = {W € {0,1}* ||w| > 2 and w ends in 00 or in 01}. We choose Q = {s, 41, 42, Gaccept, Greject}, { = {0,1}*, T = EU{-} and the transitions: 0 0 R 1 R 91 L 0 L 42 L 91 Greject R 42 0 Paccept 0 R 92...
Answer and explain your answer QUESTION 5 A Turing machine M with start state go and accepting state of has the following transition function: 1 8(q,a) 0 B 40 (90,1,R) (91,1,R) (9f,B,R) 91 (42,0,L) (42,1,L) (92,B,L) 42 (90,0,R) 9f Deduce what M does on any input of O's and I's. Hint: consider what happens when M is started in state qo at the left end of a sequence of any number of 0's (including zero of them) and a 1....
please answer and I will rate! 3. Let L = {M M is a Turing machine and L(M) is empty), where L(M) is the language accepted by M. Prove Lis undecidable by finding a reduction from Arm to it, where Ayv-<<MwM is a Turing machine and M accepts w). Answer:
2. Let L-M M): M is a Turing machine that accepts at least two binary strings. a) Define the notions of a recognisable language and an undecidable language. [5 marks [5 marks] b) Is L Turing-recognisable? Justify your answer with an informal argument. c) Prove that L is undecidable. (Hint: use Rice's theorem.) [20 marks] 20 marks] d) Bonus: Justify with a formal proof your answer to b). 2. Let L-M M): M is a Turing machine that accepts at...