A "standard" single-tape Turing machine M has a one-way infinite tape; the set of valid tape head positions is N (nonnegative integers). A two-way-infinite Turing machine T is a single-tape Turing machine where the set of valid tape head positions is Z (integers). In other words, there is no "leftmost" tape cell; the tape head can move arbitrarily far to the left as well as arbitrarily far to the right. (See example T in part (b) below.) (a) Describe in general how an arbitrary configuration of a two-way-infinite Turing machine T can be represented as a configuration of a standard one-way-infinite Turing machine M.

A "standard" single-tape Turing machine M has a one-way infinite tape; the set of valid tape head positions is N (nonnegative integers). A two-way-infinite Turing machine T is a single-tape Turing machine where the set of valid tape head positions is Z (integers). In other words, there is no "leftmost" tape cell; the tape head can move arbitrarily far to the left as well as arbitrarily far to the right. (See example T in part (b) below.) (a) Describe in general how an arbitrary configuration of a two-way-infinite Turing machine T can be represented as a configuration of a standard one-way-infinite Turing machine M.

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 deterministic two-tape Turing machine, which begins with a string of the form an on the first tape, and a string of the form am on the second tape. (n, m ∈ N.) Both heads begin scanning the left-most character of each string. The Turing machine should accept if the number n is an integer multiple of the number m; i.e. there is some integer k such that n = k · m. First, describe the algorithm that your machine uses. Then draw a transition diagram for the machine. To answer properly, your machine should handle the cases when either n or m is zero correctly.
Draw a state diangram for a Turing machine which, when given an input string 0", outputs 0"1". For example, if the tape contains 0000 at the beginning, then the tape should contain 00001111 when the TM halts. You may omit transitions that won't ever be taken. 4.
Construct a Turing Machine that computes the expression 2x+y, where x, y 2 0, and are represented on the tape as a sequence of 1s separated by a 0. For e. g., Say, x = 3, y = 5 are represented on the screen as -111011111; At the end of the computation, the tape contents should be +11111111111 representing the number 2x+y = 2(3)+5 = 11. Solution hint: a. If x = 0 and y = 0, Accept. b. If x = 0, then 2x+y = y, Accept. c. Replace 1s of x with A. d. For each A, replace A with 1, and add a 1 at the end of the tape contents. e. Finally, Move 0 to the end f tape contents, and replace with a Blank, and Accept.
How can I create a Turing machine with ones and zeros, which finds out if an integer n, represented as a sequence of n 1s (111 representes 3), is divisible by 2 or not. It should start in position of the 1 on the far left. When it stops, the output should be 0 if the number is divisible by 2, and 1 if the number is not divisible by 2. Examples: Input = 111, Output = 001 (3 is not divisible by 2, 3 divided by 2 gives 1 in remainder) Input = 1111, Output = 0000 (4 is divisible by 2, 4 divided by 2 gives 0 in remainder)
Consider the Turing Machine defined as follows (q0,0,q0,0,R), (q0,1,q1,0,R), (q0,B,q2,B,R), (q1,0,q1,0,R), (q1,1,q0,1,R) and (q1,B,q2,B,R). Describe what this TM does when presented with bit strings defined over the alphabet = {0,1} as input. (Note: B = Blank).
Design Turing Machines using JFLAP to compute the fol- lowing function where x is an integer represented in unary. The value f(x) represented in unary should be on the tape surrounded by blanks after the calculation. Also show some test cases. f(x) = x (mod5)
Suppose that Turing machine M computes the unary number-theoretic function f defined by f(n) = n2 + 6n + 3 and suppose, further, that M is started scanning the leftmost 1 in an unbroken string of six 1s on an otherwise blank tape. Then M will halt scanning the leftmost 1 in an unbroken string of how many 1s?
please draw the the states of the Turing Machine
Solve quickly Define universal turing machine and determine the number of symbols necessary to simulate a Turing machine given that there are m symbols and n states.
Construct a 3-tape Turing Machine that multiplies binary numbers. Seperator --> '#' so for example: 11#101 1011#100 111#1000 3rd tape copies down the result onto the tape
Turning Machine Computer
Draw a Turing Machine to compute the following function from natural numbers to natural numbers: f: N -> N: f(n)=3n-2