Specify a Turing machine with input alphabet Σ = {a, b} that recognizes the language L = { ww | w ∈ Σ ∗}. Is L decidable?
The approach behind the construction of this Turing machine is firstly finding the mid point and then doing matching.
For example the string abaaba should be accepted by this Turing machine and if it will be done than we can also state that the language is decidable because from one of the definition of the language decidability if we are able to construct a Turing machine which will able to accept and reject the string generated by the language then we can say language is decidable.
By a/X/R we means we are scanning first symbol a and converting it to the second symbol X and then moving right.
Notation :-
R - Right , L - Left , B - Blank
X , Y - variables used for conversion of a , b respectively.
qi , qf represent our initial and final states.
Therefore the language is decidable since we are able to construct the Turing machine and accept the string generated by this language.
Specify a Turing machine with input alphabet Σ = {a, b} that recognizes the language L...
Specify in detail a (deterministic) a Turing machine that accepts the language L = a* ba* (your Turing machine must halt on input w if, and only if, w € L). Remember: since your machine is deterministic, it must have a well-defined behavior for any possible symbol of the input alphabet, i.e, a, b, and #, in each state, except that you only need to ensure that your Turing machine behaves correctly when started in the configuration (s, #w#). Thus,...
Show that the following language is decidable. L={〈A〉 | A is a DFA that recognizes Σ∗ } M =“On input 〈A〉 where A is a DFA:
Design a Turing machine that recognizes the language L := {vSw : u, w E {0,1)" and u is a substring of u For example, 0801 E L' 10$010 E L, but i 00$10101 ¢ L. Describe the High Level algorithm informally and define the corresponding Turing Machine in details. Design a Turing machine that recognizes the language L := {vSw : u, w E {0,1)" and u is a substring of u For example, 0801 E L' 10$010 E...
Construct a Turing Machine (TM) that accepts the following language, defined over the alphabet Σ = {0,1): at accepts the tollowing language, define [10] Give the transition diagram and explain the algorithm implemented by your TM.
(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.
Automata, Languages, and Computation Design a Turing machine that recognizes the language For example, 0$01 e L, 10$010 E L, but 100810101乒L. Describe the High Level algorithm informally and define the corresponding Turing Machine in details. Design a Turing machine that recognizes the language For example, 0$01 e L, 10$010 E L, but 100810101乒L. Describe the High Level algorithm informally and define the corresponding Turing Machine in details.
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)...
3b. Consider the language FIN = { | M is a Turing machine and L(M) is finite }. Prove FIN is not decidable.
Consider the language LOOPS = {<M,w> | M is a Turing machine and M loops forever on input w} Is LOOPS Turing decidable? Explain why or why not. Is LOOPS Turing recognizable? Explain why or why not.
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,...