Which of the following statements on Turing machine models can be correct: (1). A Turing machine can have a semi-infinite tape. (2). The Turing machine can be implemented off-line, read state from input file. (3). Turing machine can be implemented to have multidimensional storage. Select one: O a. (1) and (3) are correct. O b. (1) and (2) are correct. O c. (1), (2), and (3) are correct. O d. (2) and (3) are correct.

Which of the following statements on Turing machine models can be correct: (1). A Turing machine can have a semi-infinite tape. (2). The Turing machine can be implemented off-line, read state from input file. (3). Turing machine can be implemented to have multidimensional storage. Select one: O a. (1) and (3) are correct. O b. (1) and (2) are correct. O c. (1), (2), and (3) are correct. O d. (2) and (3) are correct.

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

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.
Create a Turing machine that when started anywhere on the tape will halt if and only if there is a 0 somewhere on the tape., since it only lets you enter a single input string as the starting configuration of the tape. （For this problem, the tape can start with 0s and 1s scattered anywhere on the tape - they do not have to be contiguous. Any permutation of 0s, 1s and blanks is a possible starting configuration.）
Construct a Turing machine with a two-dimensional tape that “draws” a 2 x 3 table and begins with the cell in the lower left corner, i'll rate up if correct please
Construct a turing machine that computes the function ?(?)=2?, i.e. if the input is 0^? then the output should be 0^2n, e.g. if it says 000 on the tape before the machine is run it should read 000000 on the belt when it has stopped.
Create a single tape Turing machine that has the alphabet a, b, c and null. This Turing machine begins with (a+b+c)* and ends with a tape content of (abc)* e.g. abcabcabc... please use jflap if possible
Construct a turing machine that computes the function ?(?)=2?, , i.e. if the input is 0^? then the output would be 0^2? e.g. if it says 000 on the tape before the machine is run it should read 000000 on the tape when it has stopped.
Build a Turing Machine T.M with three tracks that add two binary numbers. We will consider that the datas are stored in the first two tracks and are aligned to the right. The result will be written to the third track which is initially empty.
Question: How Can I Write A Turing Machine That Begins On A Tape Containing A Single 1 And Never Halts But Successively Displays The Strings ...B1b... ...B010b... ...B00100b...and so on
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 ⋯
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.
(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
Construct a Turing machine (your answer must show all of the 5-tuples involved) that computes n mod 3, where n ≥ 0. You must use unary ones format: 0 is 1, 1 is 11, 2 is 111, and n is n+1 1s.Note that all computations: of n mod m must be either 0 (1), 1 (11), or 2 (111).Be sure to leave the read/write head over the leftmost 1 when done.Verify your Turing machine by giving a step-by-step trace of 2 mod 3 and 7 mod 3.