Homework Answers
1. True : the above language is context free which means it is also context sensitive.
2. True : All context sensitive languages are recursively enumerable.
3. False : The above language requires comparison of 3 numbers which is not possible in context free, it is context sensitive.
4. False : The language is CF, CS, REC and RE but not DCF.
5. True : Some languages can't be accepted by T.M.
6. True : A rec is a language for which there exist a halting T.M.
Add Answer to:
Question 5 10 pts Select all the statements below which are true: The grammar below is...
10 pts Question 5 Select all the statements below which are true: Any REC language is...
10 pts Question 5 Select all the statements below which are true: Any REC language is RE. Any REC or RE language is accepted by some Turing Machine. @ Every language is accepted by some TM @ The language L (a"bc :n1 is CF. The language L (aww :n 2 0, w E (a b)') is CF cs, REC, and RE. : T The grammar below is CS A- acbA I a
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...
Question 3 Consider the grammar G defined below: SaSa|Aa|abbB ABAN BaB| bb Select all the statements...
Question 3 Consider the grammar G defined below: SaSa|Aa|abbB ABAN BaB| bb Select all the statements below which are true. Grammar G is context free. O Grammar G is regular. Grammar G is CS. O Grammar G is unrestricted. Grammar G is linear.
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...
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...
Question 1 10 pts Draw the transition graph of a Turing Machine (TM) that accepts the...
Question 1 10 pts Draw the transition graph of a Turing Machine (TM) that accepts the language: L = {aw: w € {a,b}" } U{(bb)" ac: n > 3 and n is divisible by 3} Write the sequence of moves done by the TM when the input string is v= abbca. Is the string v accepted?
true or False with prove? (f) ___ NP =co-NP (g) The complement of any recursive language...
true or False with prove?
(f) ___ NP =co-NP (g) The complement of any recursive language is recursive. h) The grader's problem is decidable. We say programs Pi and P are equivalent if they give the same output if given the same input. The problem is to decide whether two programs (in C++, Pascal, Java, or some other modern programming language) are equivalent. )Given any CF language L, there is always an unambiguous CF grammar which generates L 6)Given any...
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...
Question 4 Consider the grammar G defined below: SabAc|Ba bAbAaac 1- Baalaa Bκαι bΒΙλ Select all...
Question 4 Consider the grammar G defined below: SabAc|Ba bAbAaac 1- Baalaa Bκαι bΒΙλ Select all the statements below which are true. O Grammar G is regular. O Grammar G is not CS. Grammar G is unrestricted. Grammar G is not context-free,
Question 1: Every language is regular T/F Question 2: There exists a DFA that has only...
Question 1: Every language is regular T/F Question 2: There exists a DFA that has only one final state T/F Question 3: Let M be a DFA, and define flip(M) as the DFA which is identical to M except you flip that final state. Then for every M, the language L(M)^c (complement) = L( flip (M)). T/F Question 4: Let G be a right linear grammar, and reverse(G)=reverse of G, i.e. if G has a rule A -> w B...
10 pts Question 5 Select all the statements below which are true: Any REC language is RE. Any REC or RE language is accepted by some Turing Machine. @ Every language is accepted by some TM @ The language L (a"bc :n1 is CF. The language L (aww :n 2 0, w E (a b)') is CF cs, REC, and RE. : T The grammar below is CS A- acbA I a
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...
Question 3 Consider the grammar G defined below: SaSa|Aa|abbB ABAN BaB| bb Select all the statements below which are true. Grammar G is context free. O Grammar G is regular. Grammar G is CS. O Grammar G is unrestricted. Grammar G is linear.
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...
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...
Question 1 10 pts Draw the transition graph of a Turing Machine (TM) that accepts the language: L = {aw: w € {a,b}" } U{(bb)" ac: n > 3 and n is divisible by 3} Write the sequence of moves done by the TM when the input string is v= abbca. Is the string v accepted?
true or False with prove?
(f) ___ NP =co-NP (g) The complement of any recursive language is recursive. h) The grader's problem is decidable. We say programs Pi and P are equivalent if they give the same output if given the same input. The problem is to decide whether two programs (in C++, Pascal, Java, or some other modern programming language) are equivalent. )Given any CF language L, there is always an unambiguous CF grammar which generates L 6)Given any...
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...
Question 4 Consider the grammar G defined below: SabAc|Ba bAbAaac 1- Baalaa Bκαι bΒΙλ Select all the statements below which are true. O Grammar G is regular. O Grammar G is not CS. Grammar G is unrestricted. Grammar G is not context-free,
Most questions answered within 3 hours.
-
Which of these methods cause sterilization?
Autoclaving
Dry heat
Gamma irradiation
Ethylene oxide
A.
Yes
No...
asked 3 minutes ago -
A biologist wishes to estimate the effect of an antibiotic on
the growth of a particular...
asked 11 minutes ago -
O’Deesha Company has the following information available:
Quality engineering of
products
$20,000
Quality training of
employees &n
asked 19 minutes ago -
a) Draw two water molecules.
b) Clearly name and label the type of bond that exists...
asked 1 hour ago -
C - Language
Write a loop that sets each array element to the sum of itself...
asked 2 hours ago -
(63
#14)
which of the following statments best describes how chamging
the concentration of the substances...
asked 6 hours ago -
In the following reaction, which element is undergoing
oxidation: Na2SO3 + N2O --> N2 + Na2SO4...
asked 6 hours ago -
Which of the following pairs of ions have the same electron
configuration?
I: Br− and Se2−...
asked 9 hours ago -
The Foremost Composite Materials Company is planning a two-day
sales conference for October 19-20. The conference...
asked 9 hours ago -
3) Illustrate the observed pattern of relatedness of organisms
versus adaptations to specific conditions. This means...
asked 10 hours ago -
In winter a lake has a 0.35 m thick ice layer over 1.10 m of
water....
asked 11 hours ago -
Assuming the following has been encrypted with a Vigenere cipher
below, use the method(s) and assumptions...
asked 11 hours ago