Homework Answers
1) halts at state 4. Tape=>#aa
2) halts at state 4. Tape=>#ba
3) halts at state 4. Tape=>#babb
4) accepts strings starting with b and ending with a and of min length 2
Add Answer to:
Consider the following Turing Machine: Show the execution traces using each of the following input strings:...
Solve the following Turing Machine (Reversing the strings). The alphabet is a,b,c, and null. The input...
Solve the following Turing Machine (Reversing the strings). The alphabet is a,b,c, and null. The input is (a+b+c)+ the output should be a mirror reflection of the input. For example if the input is aabccc then the output should be cccbaa.
Question 6 Consider the Turing Machine (TM) T (over the input alphabet Σ = {a, b})...
Question 6
Consider the Turing Machine (TM) T (over the input
alphabet Σ = {a, b}) given below.
(b,b,R) (a.a, R) (b.b,,R) (A,A,L) 1 Start 2 نيا 4 Halt (a, a,R) (a, a,R) (b,b,R) (A,A,R) Trace the execution of the TM on a few strings of as and bs so that you can see how it works and answer the following questions. 6.1. What is the shortest word that would be accepted by T? (2) 6.2. What is accept(T)? (2)...
please answer a,b, and c Consider the following Turing Machine. M = “On input hA,Bi where...
please answer a,b, and c Consider the following Turing Machine. M = “On input hA,Bi where A and B are DFAs: 1. Iterate through strings in Σ∗ in shortlex order; where Σ represents the common symbols of their input alphabets. For each string iterated, simulate both A and B on it. 2. If a string is ever encountered that both A and B accept, then accept.” (a) (2 points) Give a description, in English, of the language that M recognizes....
7.(10%) Give the Turing machine as shown below. 1) Examine the following strings are recognized or...
7.(10%) Give the Turing machine as shown below. 1) Examine the following strings are recognized or not. a) 01100110 b) 11001011 2) In general, what language does this Turing machine recognize? Obr. 0, b, R 1 R 1,1R
Third time posting, can someone answer please. Question 2. Consider the Turing machine defined as follows....
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)...
Problem 3: Turing Machine Models Turing-Recognisablity and Decidability [20] a. Show that an FA w...
Subject : Theory of Computation
Please answer , posting second time now cause nobody answered it
previously
Problem 3: Turing Machine Models Turing-Recognisablity and Decidability [20] a. Show that an FA with a FIFO queue is Turing universal (i.e equivalent in computational power to a Turing machine). You should regard this machine as being formally defined in a way that is very similar to a PDA, except that on each transition, instead of pushing and/or popping a character, the machine...
2. Let L = {hMi: M is a Turing machine that accepts at least two binary strings}. a) Define the notions of a recognisabl...
2. Let L = {hMi: 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] b) Is L Turing-recognisable?
Justify your answer with an informal argument. [5 marks] c) Prove
that L is undecidable. (Hint: use Rice’s theorem.) [20 marks] d)
Bonus: Justify with a formal proof your answer to b). [20
marks]
2. Let L-M M): M is a Turing machine that accepts...
2. Let L-M M): M is a Turing machine that accepts at least two binary strings. a) Define the notions of a recognisable...
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...
1. (25 points) Turing Machine Design: Design a Turing machine Mi that operates on inputs that...
1. (25 points) Turing Machine Design: Design a Turing machine Mi that operates on inputs that are strings in 10, 1). Design Mi so that it recognizes the following language: fw E (0.1)l w ends in 10 or 111) a. Provide a high-level English prose description for the actions of Mi b. Provide an implementation-level description of M. c. List the parts of the formal 7-tuple for M d. Draw a detailed pictorial state diagram for M1 e. List the...
For each code fragment below, show a memory diagram that traces the execution of the calling...
For each code fragment below, show a memory diagram that traces
the execution of the calling method.
d) //calling method intp data = {1, 3, 5); method(datal2 public static int methodliot size) nt source new intfsize: for (int i-0; issourclength:i) sourceli)-size; return source; Heap Identifier Address Contents Main Stack Frame 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 Identifier Address Contents 101 102 103 Method Stack Frame Identifier Address Contents 200 201 202
Question 6
Consider the Turing Machine (TM) T (over the input
alphabet Σ = {a, b}) given below.
(b,b,R) (a.a, R) (b.b,,R) (A,A,L) 1 Start 2 نيا 4 Halt (a, a,R) (a, a,R) (b,b,R) (A,A,R) Trace the execution of the TM on a few strings of as and bs so that you can see how it works and answer the following questions. 6.1. What is the shortest word that would be accepted by T? (2) 6.2. What is accept(T)? (2)...
7.(10%) Give the Turing machine as shown below. 1) Examine the following strings are recognized or not. a) 01100110 b) 11001011 2) In general, what language does this Turing machine recognize? Obr. 0, b, R 1 R 1,1R
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)...
Subject : Theory of Computation
Please answer , posting second time now cause nobody answered it
previously
Problem 3: Turing Machine Models Turing-Recognisablity and Decidability [20] a. Show that an FA with a FIFO queue is Turing universal (i.e equivalent in computational power to a Turing machine). You should regard this machine as being formally defined in a way that is very similar to a PDA, except that on each transition, instead of pushing and/or popping a character, the machine...
2. Let L = {hMi: 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] b) Is L Turing-recognisable?
Justify your answer with an informal argument. [5 marks] c) Prove
that L is undecidable. (Hint: use Rice’s theorem.) [20 marks] d)
Bonus: Justify with a formal proof your answer to b). [20
marks]
2. Let L-M M): M is a Turing machine that accepts...
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...
1. (25 points) Turing Machine Design: Design a Turing machine Mi that operates on inputs that are strings in 10, 1). Design Mi so that it recognizes the following language: fw E (0.1)l w ends in 10 or 111) a. Provide a high-level English prose description for the actions of Mi b. Provide an implementation-level description of M. c. List the parts of the formal 7-tuple for M d. Draw a detailed pictorial state diagram for M1 e. List the...
For each code fragment below, show a memory diagram that traces
the execution of the calling method.
d) //calling method intp data = {1, 3, 5); method(datal2 public static int methodliot size) nt source new intfsize: for (int i-0; issourclength:i) sourceli)-size; return source; Heap Identifier Address Contents Main Stack Frame 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 Identifier Address Contents 101 102 103 Method Stack Frame Identifier Address Contents 200 201 202
Most questions answered within 3 hours.
-
Write a program to solve the Josephus problem, with the following
modification:
Sample Input:
./a.out n...
asked 31 minutes ago -
At the start of a CD it is spinning at a rate of 525 rpm
(revolutions...
asked 1 hour ago -
4. Without doing any calculations, predict whether the observed
∆T would increase, decrease or remain the...
asked 2 hours ago -
Based on the range, which of the following sets of scores has
the greatest variability? 3,...
asked 3 hours ago -
Ripples in a pond travel at a velocity of 3 m/s with one peak
passing a...
asked 3 hours ago -
A man stands on the roof of a building of height 13.0 mm and
throws a...
asked 3 hours ago -
The extent to which assets are financed by borrowed funds and
other liabilities is indicated by:...
asked 4 hours ago -
Explain in detail
Germany is the fifth largest economy
explain what goods and services Germany specializes...
asked 4 hours ago -
The density of platinum is 21.45 g/mL. If a cube of platinum
with a mass of...
asked 4 hours ago -
Accounts Receivable
Sales
A/R Posting
Extended Sales Invoice
Packing Slip
Compare invoice to packing slip 2...
asked 4 hours ago -
Michaella, age 23, is a full-time law student and is claimed by
her parents as a...
asked 4 hours ago -
Why are polymers not typically casted into products?
asked 5 hours ago