What is the language of accepted strings by the below Turing machine?
{a*b*} |
||
{ambn | m, n ≥ 0} |
||
{ambm | m ≥ 0} |
||
{ambnam | m, n ≥ 0} |
||
This Turing machine is non-deterministic, so it cannot accept a deterministic language. |
What is the language of accepted strings by the below Turing machine? {a*b*} {ambn | m,...
a) What language is accepted by the Turing machine d(%-a)-(%-a, R), d(%-a)-(9-a, R). (5) Design a Turing machine that will accept language OL-L6.a) (6) Design a Turing machine that will calculate fx)-3x. You must show the representation of s and 3x on the tape of Turing machine when the calculation starts and ends, respectively Extra Questions (20 points) 1. Fill the proper words in the blank (1) Given alphabet Σ, a language on Σ isa (2) Given a grammar G,...
Show that the language A = {<M1> | the language accepted by the Turing Machine M1 is 1*} is not decidable. Present your proof in the style of the proof of Th. 5.3, which shows below. PROOF We let R be a TM that decides REGULARTm and construct TM S to decide ATM. Then S works in the following manner. S - "On input (M, w), where M is a TM and w is a string: 1. Construct the following...
Give an informal description of a deterministic Turing machine for the language L = {w ∈ {0, 1}* | w is not of the form (01)^n (10)^n for n ≥ 0}.
That is all that was given. Given the following Turing machine, what is the language accepted? You may assume qo is the start state. a>R UR
A Turing machine M decides a language L is M: Group of answer choices All of these apply. Accepts all strings in L and M rejects all strings not in L. Accepts some strings in L and M rejects some strings not in L. Accepts all strings in L that are recognizable.
(a) Give a high level description of a single-tape deterministic Turing machine that decides the language L = {w#x#y | w ∈ {0, 1} ∗ , x ∈ {0, 1} ∗ , y ∈ {0, 1} ∗ , and |w| > |x| > |y|}, where the input alphabet is Σ = {0, 1}. (b) What is the running time (order notation) of your Turing machine? Justify your 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...
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...
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
Draw the transition graph of a Standard Turing Machine (TM) that accepts the language: L = {(ba)^n cc: n greaterthanorequalto 1} Union {ab^m: m greaterthanorequalto 0} Write the sequence of moves done by the TM when the input string is w = bab. Is the string w accepted?