1. Turing machines may also be used to compute functions. Give a state-transition diagram for a Turing machine that takes as input a binary string w, increments w, and enters the accepting state. For example, on input w = 100111, the Turing machine begins like this: 90 1|0|0|1|11|-|- The Turing machine should halt with 101000 on the tape: qaccept 101000-

1. Turing machines may also be used to compute functions. Give a state-transition diagram for a Turing machine that takes as input a binary string w, increments w, and enters the accepting state. For example, on input w = 100111, the Turing machine begins like this: 90 1|0|0|1|11|-|- The Turing machine should halt with 101000 on the tape: qaccept 101000-

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

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
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.
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 ⋯
The state diagram below represents a Finite Automaton (FA) for input strings that are integers represented as binary. The machine gives the output 0 for integers, which are multiples of 2, and the output 1 for the others. 1. Will the machine accept a set of 12 input string in binary form? Why? 2. What specific state will the machine be at after the 5th transition, if the input string is 10101101? 3. What specific state will the machine be at after the 5th transition, if the input string is 1110010?
Draw a Turing machine that takes as input a string w ∈ { 0, 1, 2}*, erases the tape contents,and leaves TRUE left justified on the tape if the substring 0000 does not occur in the inputstring, otherwise leaves FALSE left justified on the tape. Give a brief description of how thetape is used and how the machine works.
For a Turing machine M(.) with an input w, let M(w) be the output on the output tape if it stops in finite steps. Let L={(M1, M2, w)| M1 and M2 are Turing machines, w is an input, and M1(w ) is not equal to M2(w)}. Prove that L is undecidable by finding a reduction from to it, where ={<M,w> |Turing machine M accepts w}.
Determine and draw a matrix or a state machine of 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 the tape. Draw
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.
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.
Describe a Turing machine (including an explicit state diagram) which, when started with a bit string on the tape with the tape head pointing at the first bit, will decrement the bit string, and then enter the accept state. If the bit string has no 1 bits (i.e., it represents 0), enter the reject state. (So, if we start with 1001100, the binary representation of 76, we should replace it with 1001011, the binary representation of 75.)
draw a Turing Machine that accepts strings in each of the languages below. Includethe septuple of the language with transition functions as well. a . L = { a n bn an bn : n ≥ 1 } b . L = { a n b m an+m: n ≥ 0, m ≥ 1} c . L = {w : w ∈ { a ,b}+ , |w| is a multiple of 4} d. L = {a n bm bn am : m ≥ 1 , n > m } e. L = {wcw : w ∈ { a ,b}* }