Define a reset Turing machine to be a variant that moves the head by either: (i) keeping the head in the same location, (ii) moving the head to right, or (iii) resetting the head to the first cell on the tape. (Otherwise, the variant is defined identically to the standard Truing machine model.) Prove a language L is Turing recognizable iff it can be recognized by a reset Turing machine. In particular, if M is the Turing machine that recognizes L, show how it is possible to construct a reset Turing machine M' that also recognizes L.

Define a reset Turing machine to be a variant that moves the head by either: (i) keeping the head in the same location, (ii) moving the head to right, or (iii) resetting the head to the first cell on the tape. (Otherwise, the variant is defined identically to the standard Truing machine model.) Prove a language L is Turing recognizable iff it can be recognized by a reset Turing machine. In particular, if M is the Turing machine that recognizes L, show how it is possible to construct a reset Turing machine M' that also recognizes L.

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

Show how to simulate an arbitrary PDA using a Turing machine. You need not give a formal description of the Turing machine (specifying the states, alphabets, transition function.) A high-level description of the operation of the Turing machine will suffice for this question.
can you help me with this question, can you please do it step by step and can you do it into full detail. Consider the problem of determining whether a Turing machine M on an input w ever attempts to move its head left at any point during its computation on w. Formulate this problem as a language and show that it is decidable.
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.
Define a nondeterministic Formally speaking, a Turing machine. Utilize the transition function in just the way you need to?
We say that a Turing machine is verbose on sif, at the completion of its computation on s, it leaves at least as many non-blank characters on the left of the tape as shastotal characters. Let VERBOSETM= { <M, w> | M is a TM and is verbose on s}. Show that VERBOSETM is undecidable by reduction from ATM. Do not use Rice’s theorem.
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.
We say that a Turing machine is verbose on sif, at the completion of its computation on s, it leaves at least as many non-blank characters on the left of the tape as shastotal characters. Let VERBOSETM= { <M, s> | M is a TM and is verbose on s}. Show that VERBOSETMis undecidable by reduction from ATM. Do not use Rice’s theorem.
Let Σ = {a, b}. Give a DFA/RE, CFG/PDA, a Turing machine, if it exists, for the language L = {w = wR|w ∈ Σ ∗ , l(w) is odd}, where wR denotes the reverse of w and l(w) denotes the length of w. If it does not exist, prove why it does not exist.
Provide a complete set of transitions for the Turing Machine that scans to the right until it finds the first ab combination and then halts. The alphabet of this Turing Machine is (a, b, u, }.
Let L = { M| M is a Turing machine and L(M) is set of all binary 0,1-strings of even length}, where L(M) is the language accepted by Turing machine M. Prove that L is undecidable by finding a reduction from to it, where ={<M,w>| M is a Turing machine and M accepts w}.
Suppose that there is a TM which on any input does not move its head more than n squares to the right (of the start point). Also, n is fixed and independent of the length of the input. Show that the language recognized by this Turing machine is regular. Explain.
Define a nondeterministic Turing machine formally. Make exact use of the transition feature.