Question

Q1: Which of the following claims are true?* 1 point The recognizable languages are closed under union and intersection The d

Q4: What can you conclude from knowing that A TM reduces to a language L? (Select all that apply)* 1 point L is empty L is de

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 that apply)* 1 point E-DFA-( 1 A is a DFA and L(A) is empty) ALL DFAAI A is a DFA over Sigma and L(A) Sigma) The complement of EDFA | | E-TM = { 1 M is a TM and L(M) is empty) The complement of E_TM Other: Q3: Select all the true statements below. * 1 point If a language L and complement of L are both recognizable, then they are both decidable A TM is undecidable but not Turing recognizable ATM is undecidable and Turing recognizable The complement of A TM is Turing recognizable
Q4: What can you conclude from knowing that A TM reduces to a language L? (Select all that apply)* 1 point L is empty L is decidable L is undecidable L is infinite Q5: Assume that a language A is reducible to language B. Which of the following claims are true?* 1 point A decider for language A can be used to decide the language B. If A is decidable then B is decidable too. If A is undecidable then B is undecidable too.
0 0
Add a comment Improve this question Transcribed image text
Answer #1

Q 5

Answer

if A is undecidable then B is undecidable too

Explanation

Lets take the first statement

A decider for language A can be used to decide the language B

It is wrong

the correct one should be

a decider for language B can be used to decide the
language A

--

Next statement

If A is decidable then B is decidable too

This is also wrong

for e.g if A is the empty language and B is A, surely it is reducible to A, but It is undecidable

the correct one is

If B is decidable then A is decidable too

--

If A is undecidable then B is undecidable too

This is correct one

so answer is C

--

all the best

Add a comment
Know the answer?
Add Answer to:
Please also note that there might be multiple answers for each question. Q1: Which of the following claims are true?*...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Q1: Which of the following claims are true?* 1 point The recognizable languages are closed under union and intersection...

    Q1: Which of the following claims are true?* 1 point The recognizable languages are closed under union and intersection The decidable lanquages are closed under union and intersection The class of undecidable languages contains the class of recognizable anguages 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 that apply) 1 point EDFA-{ «A> 1 A is a DFA and...

  • 5. (1 point) Which of the following statements is true? A. Recognizable languages are a subset...

    5. (1 point) Which of the following statements is true? A. Recognizable languages are a subset of the decidable languages. B. Some decidable languages may not be recognizable. C. A decider for a language must accept every input. D. A recognizer for a language doesn't halt. E. A decider halts on every input by either going to an accept state or a reject state. 6. (1 point) Which of the following could be false for the language L = {abclixj...

  • Only 5-9 please 1. (10 points) True/False. Briefly justify your answer for each statement. 1) Any subset of a decidable...

    Only 5-9 please 1. (10 points) True/False. Briefly justify your answer for each statement. 1) Any subset of a decidable set is decidable 2) Any subset of a regular language is decidable 3) Any regular language is decidable 4) Any decidable set is context-free 5) There is a recognizable but not decidable language 6) Recognizable sets are closed under complement. 7) Decidable sets are closed under complement. 8) Recognizable sets are closed under union 9) Decidable sets are closed under...

  • I need 7 - 10. Ignore others please! 1. (10 points) True/False. Briefly justify your answer for each statement. 1) Any...

    I need 7 - 10. Ignore others please! 1. (10 points) True/False. Briefly justify your answer for each statement. 1) Any subset of a decidable set is decidable 2) Any subset of a regular language is decidable 3) Any regular language is decidable 4) Any decidable set is context-free 5) There is a recognizable but not decidable language 6) Recognizable sets are closed under complement. 7) Decidable sets are closed under complement. 8) Recognizable sets are closed under union 9)...

  • 19. (1 point) Suppose that L is undecidable and L is recognizable. Which of the following...

    19. (1 point) Suppose that L is undecidable and L is recognizable. Which of the following could be false? A. I is co-Turing recognizable. B. I is not recognizable. C. I is undecidable. D. L* is not recognizable. E. None of the above. 20. (2 points) Let ETM {(M)|L(M) = 0} and EQTM = {(M1, M2)|L(Mi) = L(M2)}. We want to show that EQTM is undecidable by reducing Etm to EQTM and we do this by assuming R is a...

  • Question 5 10 pts Select all the statements below which are true: The grammar below is...

    Question 5 10 pts Select all the statements below which are true: The grammar below is CS. SaSa bb O Any CS language is RE. The language L = {a”b"c" : n > 1}is CF. The language L = {wwR : w€ {a, b}" } is DCF, CF, CS, REC, and RE. There are languages which are not accepted by TMs. Any REC language is accepted by some Decider (a TM that halts for every input).

  • Question 9 10 pts Select all the statements below which are true: Every dfa is also...

    Question 9 10 pts Select all the statements below which are true: Every dfa is also an nfa. A maximum of 1 final state is allowed for a dfa. Alanguage that is accepted by a dfa is a regular language. Each dfa must have a trap state 0 Let M be an nfa, and let w be an input string. If Mends in a non-final state after reading w, then wis rejected. Let = {a,b,c,d}and M be an nfa with...

  • DI Question 7 1 pts Thus far when we refer to maxterms which of the following are true (select all that apply) Are associate with ouputs of "1 B Multiple of these terms are combine to form P...

    DI Question 7 1 pts Thus far when we refer to maxterms which of the following are true (select all that apply) Are associate with ouputs of "1 B Multiple of these terms are combine to form POS ■ Inputs with "0" are kept while those "1"are inverted 毘Are associate with ouputs of "O" is the product of N distinct literals where each literal occurs once ■ is the sum of N distinct literals where each literal occurs once Multiple...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT