1st Question: One-way vs. Two-way. We wish to construct a Turing Machine = M (Q,E,F, 8, 8, Jaccept, reject) that decides the language L = {w = {0, 1}* ||w|≥ 2 and w ends in 00 or in 01} S 1 1 0 S 0 R S S 1 R S L 91 L L 91 0 92 0 L 91 92 1 L 91 92 0 92 1 Ireject Jaccept 0 R greject 1 R R L 92 L Ireject R L For which, if any, of the following machine models does M decide L? Explain your answers. (a) M is a standard machine with a one-way infinite tape. (b) M has a two-way infinite tape.

1st Question: One-way vs. Two-way. We wish to construct a Turing Machine = M (Q,E,F, 8, 8, Jaccept, reject) that decides the language L = {w = {0, 1}* ||w|≥ 2 and w ends in 00 or in 01} S 1 1 0 S 0 R S S 1 R S L 91 L L 91 0 92 0 L 91 92 1 L 91 92 0 92 1 Ireject Jaccept 0 R greject 1 R R L 92 L Ireject R L For which, if any, of the following machine models does M decide L? Explain your answers. (a) M is a standard machine with a one-way infinite tape. (b) M has a two-way infinite tape.

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

Question 3 Prove each language over {0,1} is undecidable using a reduction with A_TM = { < M, w > | w is an element of {0,1}*, M is a Turing machine, M accepts w }: a) L = { < M, k >, k > 2 | M visits at least k different states when given the empty string as input } b) L = { < M > | M halts on exactly 2 string inputs } Please solve all parts and Full explain this question and text typing work only thanks.
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. Note that all languages are encoded over the alphabet {0, 1}. L = { (M, w) | M is a Turing machine, w is a string and M should accept the input w}. A: 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}. A: 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}. A:
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
Consider the following language L over Σ = {0, 1, 2}: L = { 0i2 1 2 02i1i | i ≥ 0 } 1. Construct a Turing machine accepting L. Justify your answer, explaining how the TM youconstructed will accept words in the language L. 2. Give an accepting run of your TM for the word 0212001 Hint: think about the TM accepting the language { 0i2 1 2 02i1i | i ≥ 0 } and how can it be changed to accept the language above. Notation: recall that e.g. we write 0i for the word consisting of i-many 0’s.
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.
Let T be the Turing machine defined by the following 5-tuples:(s0, 0, s1, 0, L)(s0, 1, s1, 0, L)(s1, 0, s2, 1, R)(s1, 1, s1, 1, R)(s0, B, s1, 1, R)(s1, B, s2, 0, R)(s2, 0, s3, 1, R)(s3, 1, s3, 1, R)(s3, 0, s4, 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.states0 | B | B | 1 | 0 | 0 | B | B | B |
10 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.
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}* }
Fact: ATM {{M, w) | Turing machine M accepts w} is undecidable. So is HALT {(M, w) | Turing machine M halts on w}. = Prove that the following language is undecidable. Here M is a Turing machine. L= {(M) | M halts on at least one input and infinite loops on at least one other input} .
Using adders, subtractors, comparers, copiers or multipliers, draw a block diagram for a Turing machine that computes the function f (n) = x % y, for all positive integers x and y.
. Define a Turing Machine that accepts the following language:L = {w ∈ {!, }∗| w = vw'v where v, w' ∈ {!, }∗, |w'| = 2, and |v| = 3}
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.