Homework Answers
Add Answer to:
Problem 2. (Undecidable) and prove it (33 points) Formulate the following problem as a language is...
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...
6. (10 points) Prove that the language L = {< M 1 , M 2 >: M, , M 2 are T M s and L(M-) = L(M 2)) is undecidable....
6. (10 points) Prove that the language L = {< M 1 , M 2 >: M, , M 2 are T M s and L(M-) = L(M 2)) is undecidable.
6. (10 points) Prove that the language L = {: M, , M 2 are T M s and L(M-) = L(M 2)) is undecidable.
2. Prove that {a"6"c" |m,n0}is not a regular language. Answer: 3. Let L = { M...
2. Prove that {a"6"c" |m,n0}is not a regular language. Answer: 3. Let L = { M M is a Turing machine and L(M) is empty), where L(M) is the language accepted by M. Prove L is undecidable by finding a reduction from Aty to it, where Arm {<M.w>M is a Turing machine and M accepts Answer: 4. a) Define the concept of NP-completeness b) If A is NP-complete, and A has a polynomial time algorithm, then a polynomial time algorithm...
For the following problems (except problem 8), state whether the problem is decidable or undecidable. If...
For the following problems (except problem 8), state whether the problem is decidable or undecidable. If you claim the problem is decidable, then give a high-level, English description of an algorithm to solve the problem. If you claim the problem is undecidable, then describe a proof- by-reduction to verify your claim. If your proof involves some kind of transformation of M into M', as was done for the BlankTape problem, then provide a high -level, English description of your transformation....
State whether the problem is decidable or undecidable. If you claim the problem is decidable, then...
State whether the problem is decidable or undecidable. If you claim the problem is decidable, then give a high-level, English description of an algorithm to solve the problem. If you claim the problem is undecidable, then describe a proof-by-reduction to verify your claim. If your proof involves some kind of transformation of M into M’ , then provide a high-level, English description of your transformation. Be sure to specify precisely for each “box” in your proof, what are the inputs...
4. (25 point) Prove, by using a reduction argument, that the problem Context-Free「M = {(M): L(M)...
4. (25 point) Prove, by using a reduction argument, that the problem Context-Free「M = {(M): L(M) is context free} is undecidable. Hint: Study Section 5.1 in our text and mimic the technique which shows RegulartM is undecidable.
Prove and discuss the following reductions. Walk through the proof to show that the problem of...
Prove and discuss the following reductions. Walk through the proof to show that the problem of proving the language of a Turning Machine is a context-free language is undecidable. (Do not use Rice’s theorem as a black box and note that this is not the same problem as Theorem 5.13 in the textbook.)
Please also note that there might be multiple answers for each question. Q1: Which of the following claims are true?*...
Please also note that there might be multiple answers for each
question.
Q1: Which of the following claims are true?* 1 point The recognizable languages are closed under union and intersection The decidable languages are closed under union and intersection The class of undecidable languages contains the class of recognizable languages For every language A, at least one of A or A*c is recognizable Other: This is a required question Q2: Which of the following languages are recognizable? (Select all...
SUBJECT:THEORY OF COMPUTATION CAN SOMEONE PLEASE HELP ME I HAVE POSTED IT REPEATEDLY AND I KEEP G...
SUBJECT:THEORY OF COMPUTATION
CAN SOMEONE PLEASE HELP ME I HAVE POSTED IT REPEATEDLY
AND I KEEP GEETING INCOMPLETE / INCORRECT ANSWER . I WILL GIVE YOU
A HIGH REVIEW IF YOU HELP ME AND IT IS DONE PROPERLY !
Note: Please show/explain all cases clearly for the pumping lemma and describe how your Turing machine works for each state transition. Problem 1: Non-context-free languages and Tining Machine Models B5] context-free: 쉑: Use the pumping lemma for context-free languages to show...
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...
6. (10 points) Prove that the language L = {< M 1 , M 2 >: M, , M 2 are T M s and L(M-) = L(M 2)) is undecidable.
6. (10 points) Prove that the language L = {: M, , M 2 are T M s and L(M-) = L(M 2)) is undecidable.
2. Prove that {a"6"c" |m,n0}is not a regular language. Answer: 3. Let L = { M M is a Turing machine and L(M) is empty), where L(M) is the language accepted by M. Prove L is undecidable by finding a reduction from Aty to it, where Arm {<M.w>M is a Turing machine and M accepts Answer: 4. a) Define the concept of NP-completeness b) If A is NP-complete, and A has a polynomial time algorithm, then a polynomial time algorithm...
For the following problems (except problem 8), state whether the problem is decidable or undecidable. If you claim the problem is decidable, then give a high-level, English description of an algorithm to solve the problem. If you claim the problem is undecidable, then describe a proof- by-reduction to verify your claim. If your proof involves some kind of transformation of M into M', as was done for the BlankTape problem, then provide a high -level, English description of your transformation....
4. (25 point) Prove, by using a reduction argument, that the problem Context-Free「M = {(M): L(M) is context free} is undecidable. Hint: Study Section 5.1 in our text and mimic the technique which shows RegulartM is undecidable.
Please also note that there might be multiple answers for each
question.
Q1: Which of the following claims are true?* 1 point The recognizable languages are closed under union and intersection The decidable languages are closed under union and intersection The class of undecidable languages contains the class of recognizable languages For every language A, at least one of A or A*c is recognizable Other: This is a required question Q2: Which of the following languages are recognizable? (Select all...
SUBJECT:THEORY OF COMPUTATION
CAN SOMEONE PLEASE HELP ME I HAVE POSTED IT REPEATEDLY
AND I KEEP GEETING INCOMPLETE / INCORRECT ANSWER . I WILL GIVE YOU
A HIGH REVIEW IF YOU HELP ME AND IT IS DONE PROPERLY !
Note: Please show/explain all cases clearly for the pumping lemma and describe how your Turing machine works for each state transition. Problem 1: Non-context-free languages and Tining Machine Models B5] context-free: 쉑: Use the pumping lemma for context-free languages to show...
Most questions answered within 3 hours.
-
Calculate the pH of each of the following solutions.
0.50 M HBr
3.1×10−4 M KOH
4.2×10−5...
asked 44 minutes ago -
For the year ended December 31, Depot Max’s cost of merchandise
sold was $85,600. Inventory at the...
asked 44 minutes ago -
Week 10 - Professional Memo Assignment
Professional Memo Assignment
Your mission for this week, should you...
asked 49 minutes ago -
Write a Python program that stores the data for each
player on the team, and it...
asked 59 minutes ago -
In
the last 3 months, mike never knows when he is going to get his
allowance...
asked 1 hour ago -
Is Ca(OH)2 a Bronsted base, Lewis base, or both? Why?
asked 1 hour ago -
1A- Why don’t voters complain about U.S. tariffs on imported
sugar?
Because sugar is only a...
asked 1 hour ago -
Cash Payback Period
Primera Banco is evaluating two capital investment proposals for
a drive-up ATM kiosk,...
asked 1 hour ago -
Create a button in Swift (Xcode) that will create a charge,
create a charge using Stripe's...
asked 1 hour ago -
The reaction rate of CO and NO2 in the reaction
CO(g) + NO2(g) → CO2(g) +...
asked 1 hour ago -
Imagine that a chemist puts 6.40 mol each of
C3H8 and O2 in a 1.00-L container...
asked 1 hour ago -
How much money should be invested today in order to have $8340
at the end of...
asked 1 hour ago