2. For each N> 0 consider the language Xx = {(M) | M has more than N states}. a) Does there exist N such that XX satisfies all hypotheses of Rice's Theorem? Justify your answer. b) Does there exist N such that Xx is undecidable? Justify your answer. c) Can you obtain your answer to b) using Rice's Theorem? Justify your answer.

2. For each N> 0 consider the language Xx = {(M) | M has more than N states}. a) Does there exist N such that XX satisfies all hypotheses of Rice's Theorem? Justify your answer. b) Does there exist N such that Xx is undecidable? Justify your answer. c) Can you obtain your answer to b) using Rice's Theorem? Justify your answer.

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

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
Need help in theoretical computer science Given the following language over the alphabet Σ = {a, b, c, d}. • L = {a ^ r b ^ r c ^ r d ^ m | r, m∈IN} Answer the following questions. (i) Are infinitely many words in this language 1-inflatable? If so, include such words. (ii) Are infinitely many words in this language not 1-inflatable? If so, include such words. (iii) Can one use the pumping lemma for context-free languages to show that the language L is not a context-free language? If so, briefly outline how one can then argue. Subtask (b) Now let the following language be given over the alphabet Σ = {a, b, c, d} • L = {a^r b^ r c^r d ^ m | r, m∈IN} ∪ {a^i b ^ j c^k | i, j, k∈IN} (i) Are infinitely many words in this language 1-inflatable? If so, include such words. (ii) Are infinitely many words in this language not 1-inflatable? If so, include such words. (iii) Can one use the pumping lemma for context-free languages to show that the language L is not a context-free…
Please answer the following question in depth with full detail. Consider the 8-puzzle that we discussed in class. Suppose we define a new heuristic function h3 which is the average of h1 and h2, and another heuristic function h4 which is the sum of h1 and h2. That is, for every state s ∈ S: h3(s) =h1(s) + h2(s) 2 h4(s) =h1(s) + h2(s) where h1 and h2 are defined as “the number of misplaced tiles”, and “the sum of the distances of the tiles from their goal positions”, respectively. Are h3 and h4 admissible? If admissible, compare their dominance with respect to h1 and h2, if not, provide a counterexample, i.e. a puzzle configuration where dominance does not hold.
1. Consider the following finite state automaton, A, over the alphabet {0, 1} of binary words:(i) What is the start state of the automaton A?(ii) What are the accepting states of the automaton A? (iii) Is the automaton A deterministic? Justify your answer.
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.
Consider the following languages over the alphabet Σ = {a, b}: 1. L1 = {xwx : x, w ∈ Σ∗}2. L2 = {xwx : x, w ∈ Σ∗, |w| = 1}3. L3 = {xwx : x, w ∈ Σ∗, |x| = 1} For each language, decide whether it is regular or not regular. Prove each of your claims. If you construct a FA or a regular expression, you do not need to prove the correctness of your construction.
1): Select the law which shows that the two propositions are logically equivalent. ¬((w∨p)∧(¬q∧¬w)) ¬(w∨p)∨¬(¬q∧¬w) A): DeMorgan’s law B): Distributive law C): Associative law D): Complement law 2): Select the proposition that is a tautology. (p∧q)→¬p (p∨q)→p (p∧q)↔p 4 . (p∧q)→p A): 4 B): 1 C): 2 D): 3
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}.
Computer Science Design a deterministic finite automaton, with a minimal number of states, recognizing the language described by the regular expression 01(0 ∪ 1) *00(0 ∪ 1) *10. Justify correctness of your construction. Explain why your automaton has the minimal number of states.
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”.
1. The notion of a verifier is central to the definition of the complexity class NP. However, we can consider the idea of a verifier independent of ideas from complexity theory. Recall that a verifier for a language L is an TM V such that L = {w | V accepts <w, c> for some c}. Prove that ATM, the acceptance language for Turing machines, has a verifier even if we add the extra condition that the verifier is a decider. Note that the verifier need not run in polynomial time. We are not asking for a polynomial-time verifier. 2. Let L be a context-free language. Prove that L is NP-Complete if and only if P = NP. 3. For a string w, let w_rev be the string w reversed. For any language A, Let reverse(A) = { w_rev| w is in A}. For which of the following classes of languages is closed under the reverse operation. In other words, for which classes is it true that for every language A in the class, reverse(A) is also in the class. Context-Free languages(Closed or Not Closed) Nonregular…
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: