Consider the following Turing Machine for {a"b"c"}. Determine whether each of the following input tapes is accepted or not and find in which state the machine halts and how the tape has been changed at halt. See the example in the table below, and fill the rest of the table. [Note: ɛ stands for empty string] 90 B/B,R a/X,R b/b,R Z/Z,R a/a,R b/Y,R Y/Y,R C 91 92 96 c/Z,L a/X,R X/X,R 94 93 a/a,L Y/Y,R Y/Y,L Z/Z,L B/B,R 95 Y/Y,R U zizR

Consider the following Turing Machine for {a"b"c"}. Determine whether each of the following input tapes is accepted or not and find in which state the machine halts and how the tape has been changed at halt. See the example in the table below, and fill the rest of the table. [Note: ɛ stands for empty string] 90 B/B,R a/X,R b/b,R Z/Z,R a/a,R b/Y,R Y/Y,R C 91 92 96 c/Z,L a/X,R X/X,R 94 93 a/a,L Y/Y,R Y/Y,L Z/Z,L B/B,R 95 Y/Y,R U zizR

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Construct a Turing machine that takes strings over the alphabet {a,b} on the tape, and moves the whole string over to the right one cell position. When you're done, the tape should essentially look the same (since it's infinite on both ends…) but you will know (and people who look at your code will know) that in fact you moved the string over by one space to the right. After moving the string over, the turing machine should move to the left-most cell in the string and than go to the HALT state.
(b) The following is the state diagram of a Turing machine M1 with inputalphabet {0, 1} and accept state q5. (Missing transition arrows are assumed to lead to a reject state, not shown.) (i) Give the sequence of configurations of M1 on the input string 01,starting with initial configuration q001. [6](ii) In general, given any input string w, what will the tape contentsof M1 look like after halting? [3
1. Determine the Turing machine that computes the function: f(n) = 4n+3 The machine should therefore start with a natural number n on the tape and stop with the number 4n+3 on it the tape . (Hint: Think binary.) 2. Determine a Turing machine for creating palindromes. That is, if we start with w on the tape, then we should end with ww on the tape, where w is the reversed string of w. E.g. if we start with |-011 on the tape, then we should stop with |-011110 on the tape
For each language below, indicate whether the language is: 1) in P, 2) in NP but probably not in P, or 3) probably not in NP. Give a brief informal justification for your answer 1. L = { (M, w) | M is a Turing machine, w is a string and M should accept the input w}. 2. L = {[w,x] | w is list of cities with distance between them, x is a visiting order and x must be the shortest path that travels between all the cities visiting each one only once}. 3. L = {[M, w] | M is a context free language in Chomsky normal form, w is a string and w is accepted by the language M}.
Consider L={(TM) | TM stands for the Turing machine, which halts on all input, and L(TM)= L' for some undecidable language L'}. The encoding of a Turing machine as a string over the alphabet 0-1 is (TM), and L is? decidable and recursively enumerable decidable and recursive decidable and non-recursive undecidable and recursively enumerable
Let T be the Turing machine defined by the following 5-tuples: (s0, 0, s0, 1, R), (s0, l, s1, 0, R), (s1, l, s2, l, R), (s1, B, s0, 0, R). For the following tape, determine the intermediate tapes, states, and head positions, and final tape, state, and head position when T halts. Assume T begins in the initial position. state s0 ⋯ B B 0 0 0 1 B 0 B B ⋯
Define the notion of a Turing machine with a two-dimensional tape. Show that a 2-tape ordinary Turing machine can simulate it. Estimate the efficiency of the above simulation. give the running time of the new machine with the running time function TM (n) of the original machine.
Consider a Turing machine that cannot write blanks; that is, for all λ(qi, a) = (qj, b, L or R), b must be in Γ- {□}. Show how such a machine can simulate a standard Turing machine.
Give the transition diagram for a one-tape Turing machine that recognizes the language L = {anbkn: n>=1, k>=1}. That is, L is the language of words of the form aibj where j is a multiple of i, so aabbbb; aaabbb; abbbbbbb ∈ L but aabbb ∉ L. Your TM must be a one-tape machine.
Build a Turing Machine T.M. with three tracks that receives two binary numbers and indicates which of the two is higher. We will consider that the data are stored in the first two tracks and aligned to the right, it means, the least significant bits of both are located in the same column. In the third track it will be written a B, a L or an E, indicating respectively that the first number is larger, smaller or equal to the second.
Suppose we make the restriction that a Turing machine must always write a symbol different from the one it reads, that is, if δ(qi; a) = (qj ; b; L or R), then a and b must be different. Does this limitation reduce the power of the automaton? Explain.
A 2-dimensional Turing machine has an infinite 2-dimensional grid asits storage device (one cell for every address (i, j) ∈Z×Z). Instead ofL and R, there are 5 options for the head to move from (i, j): Left (to(i −1, j), Right (to (i + 1, j)), Up (to (i, j + 1)), Down (to (i, j −1)),and Stay (remain at (i, j)) .Let us assume, that our 2-dimensional TM M has an additional 1-dimensional tape where the input is located as in a 1-tape TM. The2-dimensional storage device contains a blank symbol in every cell atthe start of the computation.Show that a 2-dimensional TM is not more powerful, i.e., every lan-guage accepted by a 2-dimensional TM M is accepted by one of ourstandard 1-dimensional TMs. You don’t have to simulate directly witha 1-tape TM, as you are allowed to use what we know about k-tape(1-dimensional) TMs without proof.Describe the moves of a simulating TM M ′ in plain English. For everypossible move of M , you have to design a sequence of moves of M ′that simulates that move of…