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.
Solve the following Turing Machine (Reversing the strings). The alphabet is a,b,c, and null. The input...
Construct a Turing machine with input alphabet {?, ?}, which accepts strings of even length.
Construct a Turing machine with input alphabet {?, ?}, which accepts strings with the same number of a’s and b’s.
Formally describe a 2-tape deterministic Turing Machine that accepts strings on the {0,1} alphabet. Such strings have the number of "0" double than "1".
The UTM (universal Turing machine) operates with a fixed alphabet. We claim that the UTM can simulate any Turing machine, but the Turing machine (to be simulated) may have an input alphabet Σ (for example the Greek alphabet) and an output alphabet Ω (for example the English alphabet) which are different than the UTM’s alphabet. 1 Explain how a string over Σ can be converted to a string over the UTM’s alphabet, a process we can call CODING. 2 Explain...
Specify a Turing machine with input alphabet Σ = {a, b} that recognizes the language L = { ww | w ∈ Σ ∗}. Is L decidable?
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)...
Consider the following Turing Machine: Show the execution traces using each of the following input strings: (a) aaa (b) aba (c) ababb (d) What does the machine do?
Give the implementation-level description of a Turing machine that decides the following language over the alphabet a, b, c^. You are encouraged but not required to use a multi- tape and/or nondeterministic Turing Machine. Lan n s a positive integer )
Design a TM (Turing Machine) which writes the reverse of the input word on the tape after reading the first blank after the word. The input alphabet is = { &, c, d), and assume the word starts with &, then with a word from (c+d)* As an example: input tape is &ccdd..., after executing the Turing Machine, the tap would contain &ccddddcc We were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe...
i need answer for this. Construct a Turing machine with two-way tape and input alphabet fa} that halts if tape contains a nonblank square. The symbol a may be anywhere on the tape, not necessarily to the immediate right of the tape head.