For each of the following languages, say whether it is decidable. Justify your answerin about 5-10 sentences.(a) L₁ = {(M, t) | Turing machine M accepts some input in at least t steps}(b) L2 ={(M) | Turing machine M infinite loops on some input}(c) L3 ={(M₁, M2) | M₁, M2 are Turing machines such that L(M₁) ‡ L(M₂)}(d) L₁ = {(M, t) | Turing machine M accepts every input in at most t steps}

The complete answer of all parts is below:

For each of the following languages, say whether it is decidable. Justify your answer in about 5-10 sentences. (a) L₁ = {{M, t) | Turing machine M accepts some input in at least t steps} (b) L₂ = {(M) | Turing machine M infinite loops on some input} (c) L3 = {(M₁, M2) | M₁, M2 are Turing machines such that L(M₁) ‡ L(M₂)} (d) L₁ = {{M, t) | Turing machine M accepts every input in at most t steps}

For each of the following languages, say whether it is decidable. Justify your answer in about 5-10 sentences. (a) L₁ = {{M, t) | Turing machine M accepts some input in at least t steps} (b) L₂ = {(M) | Turing machine M infinite loops on some input} (c) L3 = {(M₁, M2) | M₁, M2 are Turing machines such that L(M₁) ‡ L(M₂)} (d) L₁ = {{M, t) | Turing machine M accepts every input in at most t steps}

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

Determine a Turing machine for the language L = {ww_ | w is a string of 0s and 1s} where w_ is the reversed string of w. If w = 011, then w_ = 110. The Turing machine must therefore check whether the input string x belongs to the language L. Draw a Finite state machine
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:
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.
Prove the following: If a language L is recognized by a Turing machine M that has one two-way-infinite single-track tape with two-heads then L is recognized by a Turing machine M' that has two one-way-infinite three-track tapes. (Note that M' has three tracks per tape.) Do give a formal construction of M'
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 ⋯
. 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 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, ...}
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}.
Give the transition diagram for a one-tape Turing machine that recognizes the language L = {anbkn: n>=1, k>=1}. That is, L is the language of words of the form aibj where j is a multiple of i, so aabbbb; aaabbb; abbbbbbb ∈ L but aabbb ∉ L. Your TM must be a one-tape machine.
Determine a Turing machine for the language L = {ww | w is a string of 0s and 1s} where w is the reversed string of w. If w = 011, then w = 110. The Turing machine must therefore check whether the input string x belongs to the language L
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.
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.