Classify the language { (G) | G is a CFG, L(G) contains a palindrome}\ as (a) decidable (b) Turing-recognizable but not...
Classify the language
{ (G) | G is a CFG, L(G) contains a palindrome}\
as
(a) decidable
(b) Turing-recognizable but not co-Turing recognizable
(c) co-Turing recognizable but not Turing-recognizable
(d) neither Turing nor co-Turing recognizable
Justify your answer
Homework Answers
Grammar is a context free grammar .
And There is no halting machine (Turing decidable) that can decide
whether a CFG is Ambiguous or not.
Therefore { (G) | G is a CFG, L(G) contains a palindrome} is
undecidable(Turing-recognizable).
option(b) Turing-recognizable but not co-Turing recognizable
Add Answer to:
Classify the language { (G) | G is a CFG, L(G) contains a palindrome}\ as (a) decidable (b) Turing-recognizable but not...
Let n be a positive integer. Classify the languages R = { (M) | M is a TM and L(M) contains exactly n strings} S = { (M)...
Let n be a positive integer. Classify the languages R = { (M) | M is a TM and L(M) contains exactly n strings} S = { (M) | M is a TM and L(M) contains more than n strings} as (a) decidable (b) Turing-recognizable but not co-Turing recognizable (c) co-Turing recognizable but not Turing-recognizable (d) neither Turing nor co-Turing recognizable
1. Let n be a positive integer. Classify the languages (i) R = {(M)IM is a...
1. Let n be a positive integer. Classify the languages (i) R = {(M)IM is a TM and L(M) contains exactly n strings) (ii) S- (M)|M is a TM and L(M) contains more than n strings as (a) decidable, (b) Turing-recognizable but not co-Turing-recognizable, (c) co-Turing-recognizable but not Turing-recognizable, (d) neither Turing-recognizable nor co-Turing-recognizable. Justify your answers.
(6 pts- 2 pts each) Let L be a language such that L Sm A your answers to the following questions: and AM Sm L. Just...
(6 pts- 2 pts each) Let L be a language such that L Sm A your answers to the following questions: and AM Sm L. Justify a) Is L decidable? b) Is L Turing-recognizable? c) Is L Turing-recognizable?
(6 pts- 2 pts each) Let L be a language such that L Sm A your answers to the following questions: and AM Sm L. Justify a) Is L decidable? b) Is L Turing-recognizable? c) Is L Turing-recognizable?
(6 pts-2 pts each) Let L be a language such that L Sm Any and Ay Sm L. Justify your answers to the following questi...
(6 pts-2 pts each) Let L be a language such that L Sm Any and Ay Sm L. Justify your answers to the following questions: 3. TM a) Is L decidable? b) Is L Turing-recognizable? c) Is L Turing-recognizable?
(6 pts-2 pts each) Let L be a language such that L Sm Any and Ay Sm L. Justify your answers to the following questions: 3. TM a) Is L decidable? b) Is L Turing-recognizable? c) Is L Turing-recognizable?
Give examples of the following sets (languages): a. A set (language) that is Turing-recognizable but not...
Give examples of the following sets (languages): a. A set (language) that is Turing-recognizable but not decidable b. A set (language) that is decidable but not context-free c. A set (language) that is context-free but not regular
determine if the language is regular, context-free, Turing-decidable, or undecidable. For languages that are regular, give...
determine if the language is regular, context-free, Turing-decidable, or undecidable. For languages that are regular, give a DFA that accepts the language, a regular expression that generates the language, and a maximal list of strings that are pairwise distinguishable with respect to the language. For languages that are context-free but not regular, prove that the language is not regular and either give a context- free grammar that generates the language or a pushdown automaton that accepts the language. You need...
determine if the language is regular, context-free, Turing-decidable, or undecidable. For languages that are regular, give...
determine if the language is regular, context-free, Turing-decidable, or undecidable. For languages that are regular, give a DFA that accepts the language, a regular expression that generates the language, and a maximal list of strings that arc pairwise distinguishable with respect to the language. For languages that are context-free but not regular, prove that the language is not regular and either give a context- free grammar that generates the language or a pushdown automaton that accepts the language. You need...
9. (1 point) Alice claims that a language is decidable if there exists some non-deterministic TM...
9. (1 point) Alice claims that a language is decidable if there exists some non-deterministic TM that decides it. Bob claims that a language is decidable if there exists some deterministic TM that decides it. Whose claim is correct? A. Both Alice's and Bob's. B. Only Alice's. C. Only Bob's. D. Neither Alice's nor Bob's. 10. (1 point) Which of the following is true? A. If an enumerator enumerates a language L, then L is decidable. B. If a language...
Specify a Turing machine with input alphabet Σ = {a, b} that recognizes the language L...
Specify a Turing machine with input alphabet Σ = {a, b} that recognizes the language L = { ww | w ∈ Σ ∗}. Is L decidable?
2. (10 points) Determine whether the following languages are decidable, recognizable, or undecidable. Briefly justify y...
2. (10 points) Determine whether the following languages are decidable, recognizable, or undecidable. Briefly justify your answer for each statement. 1) L! = {< D,w >. D is a DFA and w E L(D)} 2) L2- N, w> N is a NF A and w L(N) 3) L,-{< P, w >: P is a PDA and w ㅌ L(P); 4) L,-{< M, w >: M is a TM and w e L(M)} 5) L,-{< M, w >: M is a...
1. Let n be a positive integer. Classify the languages (i) R = {(M)IM is a TM and L(M) contains exactly n strings) (ii) S- (M)|M is a TM and L(M) contains more than n strings as (a) decidable, (b) Turing-recognizable but not co-Turing-recognizable, (c) co-Turing-recognizable but not Turing-recognizable, (d) neither Turing-recognizable nor co-Turing-recognizable. Justify your answers.
(6 pts- 2 pts each) Let L be a language such that L Sm A your answers to the following questions: and AM Sm L. Justify a) Is L decidable? b) Is L Turing-recognizable? c) Is L Turing-recognizable?
(6 pts- 2 pts each) Let L be a language such that L Sm A your answers to the following questions: and AM Sm L. Justify a) Is L decidable? b) Is L Turing-recognizable? c) Is L Turing-recognizable?
(6 pts-2 pts each) Let L be a language such that L Sm Any and Ay Sm L. Justify your answers to the following questions: 3. TM a) Is L decidable? b) Is L Turing-recognizable? c) Is L Turing-recognizable?
(6 pts-2 pts each) Let L be a language such that L Sm Any and Ay Sm L. Justify your answers to the following questions: 3. TM a) Is L decidable? b) Is L Turing-recognizable? c) Is L Turing-recognizable?
determine if the language is regular, context-free, Turing-decidable, or undecidable. For languages that are regular, give a DFA that accepts the language, a regular expression that generates the language, and a maximal list of strings that are pairwise distinguishable with respect to the language. For languages that are context-free but not regular, prove that the language is not regular and either give a context- free grammar that generates the language or a pushdown automaton that accepts the language. You need...
determine if the language is regular, context-free, Turing-decidable, or undecidable. For languages that are regular, give a DFA that accepts the language, a regular expression that generates the language, and a maximal list of strings that arc pairwise distinguishable with respect to the language. For languages that are context-free but not regular, prove that the language is not regular and either give a context- free grammar that generates the language or a pushdown automaton that accepts the language. You need...
9. (1 point) Alice claims that a language is decidable if there exists some non-deterministic TM that decides it. Bob claims that a language is decidable if there exists some deterministic TM that decides it. Whose claim is correct? A. Both Alice's and Bob's. B. Only Alice's. C. Only Bob's. D. Neither Alice's nor Bob's. 10. (1 point) Which of the following is true? A. If an enumerator enumerates a language L, then L is decidable. B. If a language...
2. (10 points) Determine whether the following languages are decidable, recognizable, or undecidable. Briefly justify your answer for each statement. 1) L! = {< D,w >. D is a DFA and w E L(D)} 2) L2- N, w> N is a NF A and w L(N) 3) L,-{< P, w >: P is a PDA and w ㅌ L(P); 4) L,-{< M, w >: M is a TM and w e L(M)} 5) L,-{< M, w >: M is a...
Most questions answered within 3 hours.
-
Where is the error in this code sequence?
String s1 = "Hello";
String s2 = "ello";...
asked 10 months ago -
Financial data for Joel de Paris, Inc., for last year
follow:
Joel de Paris, Inc.
Balance...
asked 10 months ago -
Consider this reaction:
Al2(SO4)3 (aq)+ BaCl3
(aq) Al2Cl6 (aq)- +
3BaSO4(s) . What is the...
asked 10 months ago -
Suppose that Savneet is considering increasing her
recent random sample from 20 car rentals to 40...
asked 10 months ago -
Trucks arrive at an unloading terminal at an average rate of 120
per hour.
Trucks arrive...
asked 10 months ago -
Why are methanol and ethanol completely soluble in water while
octanol is not very little soluble....
asked 10 months ago -
A facilities manager at a university reads in a research report
that the mean amount of...
asked 10 months ago -
When the CuSO4 is rehydrated by adding water to the anhydrous
compound, is this an endothermic...
asked 10 months ago -
A ray of sunlight is passing from diamond into crown glass; the
angle of incidence is...
asked 10 months ago -
A block of mass 0.249 kg is placed on top of a light, vertical
spring of...
asked 10 months ago -
how do the kidneys compensate in the presences of acidosis
a) trigger hyperventilate
b) reserve acid...
asked 10 months ago -
Question 501 pts
The rental rate of capital to the firm increases. Which of the
following...
asked 10 months ago