(a) There is a Turing machine that decides the set Ø (b) There is a Turing machine that is not a decider and that recognizes the set Ø. (c) There is a Turing machine that decides the set Σ* (d) There is a Turing machine that is not a decider and that recognizes the set Σ*. (e) There is a Turing machine that decides the set {www = [*} (f) There is a Turing machine that is not a decider and that recognizes the set {ww | w € Σ*}

(a) There is a Turing machine that decides the set Ø (b) There is a Turing machine that is not a decider and that recognizes the set Ø. (c) There is a Turing machine that decides the set Σ* (d) There is a Turing machine that is not a decider and that recognizes the set Σ. (e) There is a Turing machine that decides the set {www = [} (f) There is a Turing machine that is not a decider and that recognizes the set {ww | w € Σ*}

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

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.
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.
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 ⋯
first it asked to "give a turing machine" right , so where is a turing machine that follows the question?
Let L be a language. Explain, in your own words, how would you prove that: (a) L is regular, (b) Lis not regular, (c) L is context-free, (d) L is not context-free, (e) L is decidable, (f) L is notdecidable (undecidable), (g) L is Turing-recognizable, (h) L is not Turing-recognizable, (i) L isco-Turing-recognizable, (j) L is not co-Turing-recognizable.Also, give an example of each of these types of languages
. Define a Turing Machine that accepts the following language:L = {w ∈ {!, }∗| w = vw'v where v, w' ∈ {!, }∗, |w'| = 2, and |v| = 3}
1-Give a precise (mathematical) definition of a Turing machine (TM) and how its parts work together to solve problems. Perhaps, not surprisingly (maybe surprisingly ?), this most powerful machine envisioned is also the most simple known. (Other methods of computation have been developed, but each has been shown to be equivalent inexpressible power as Turing machines). What does this statement mean? 2- Describe a problem that cannot be solved by a TM. What does Undecidability 3-Is there a pumping lemma for Turing machines? if so, what is it? if not, why not?
The conventional Turing design is notoriously power-hungry. In light of this issue, please elaborate on what it is about Turing computers that causes it, and then provide an example of a non-Turing computer, such as Steve Furber's SpiNNaker, and describe how it overcomes this issue.
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}.
Develop a Turing machine for the language L={w∈{0,1}∗ ||w|isoddandwcontainsatleastone1}. This means that the Turing machine should accept all strings over {0, 1} of odd length that contain at least one 1. Show the state transition diagram in addition to your defi- nition of the Turing machine. Show the working of your Turing machine on the strings “0010”, “00101”, and “000”.
Construct a Turing machine that accepts the complement of the language L = L (aaaa* b*). The Turing machine must not make any transitions after reaching the final state. Accepted Strings L' = {a, aa, b, ab, aab, aaaba, aaaabba, aaabababb, ...} Rejected Strings L = {ε (empty string), aaa, aaaa, aaaaa, aaaaaa, ..., aaab, aaaab, aaaabb, aaaaabb, ...}