12/07/2022, 14:53 Theory of Automata and Formal Languages (KCS-402) Quiz 11 (Properties of CFLs)- Time 30 minutes

Theory of Automata and Formal

Languages (KCS-402) Quiz 11 (Properties
of CFLs)- Time 30 minutes
siddharth20it028@gmail.com Switch accounts

Draft saved

*Required

Theory of Automata and Formal Languages (KCS-402) Quiz 11 (Properties of CFLs)

- Time 30 minutes

CO5: State and prove properties of regular, context free, recursive and recursive enumerable
languages.

Which of the following languages are not context free? * 1 point

Only A

Only C

B and C

A and B

https://docs.google.com/forms/d/e/1FAIpQLScqixtVoBnQlmkHZecVl35HT7uJ7sYScro8PM6PEhHA430Jtg/formResponse 1/7
12/07/2022, 14:53 Theory of Automata and Formal Languages (KCS-402) Quiz 11 (Properties of CFLs)- Time 30 minutes

Choose the correct answer * 1 point

Choose the correct answer * 1 point

https://docs.google.com/forms/d/e/1FAIpQLScqixtVoBnQlmkHZecVl35HT7uJ7sYScro8PM6PEhHA430Jtg/formResponse 2/7
12/07/2022, 14:53 Theory of Automata and Formal Languages (KCS-402) Quiz 11 (Properties of CFLs)- Time 30 minutes

Choose the correct answer * 1 point

https://docs.google.com/forms/d/e/1FAIpQLScqixtVoBnQlmkHZecVl35HT7uJ7sYScro8PM6PEhHA430Jtg/formResponse 3/7
12/07/2022, 14:53 Theory of Automata and Formal Languages (KCS-402) Quiz 11 (Properties of CFLs)- Time 30 minutes

Choose the correct answer * 1 point

https://docs.google.com/forms/d/e/1FAIpQLScqixtVoBnQlmkHZecVl35HT7uJ7sYScro8PM6PEhHA430Jtg/formResponse 4/7
12/07/2022, 14:53 Theory of Automata and Formal Languages (KCS-402) Quiz 11 (Properties of CFLs)- Time 30 minutes

The language L = {ss | s is a string of a's and b's} is not a context-free * 1 point

language. In order to prove that L is not context-free we need to show that

for every integer n, there is some string z in L, of length at least n, such that
no matter how we break z up as z = uvwxy, subject to the constraints |uvw|
≤ n and |uw| > 0, there is some i ≥ 0 such that uvwxy is not in L.Let us focus
on a particular z = abaaabaa and assume n=8. It turns out that this is a bad
choice of z, since there are some ways to break z up for which we can find
the desired i, and for others, we cannot. Identify from the list below the
choice of u,v,w,x,y for which there is an i that makes uvwxy not be in L. We
show the breakup of abaaabaa by placing four |'s among the a's and b's.
The resulting five pieces (some of which may be empty), are the five
strings. For instance, ab|a||aabaa| means u=ab, v=a, w=ε, x=aabaa, and y=ε.

|ab|aa|ab|aa

|a|baaaba|a|

abaa|a|ba|a|

a|ba|aa|ba|a

G1 is a context-free grammar with start symbol S1 , and no other non- * 1 point

terminals whose name begins with "S." Similarly, G2 is a context-free
grammar with start symbol S2, and no other non-terminals whose name
begins with "S." S1 and S2 appear on the right side of no productions. Also,
no non-terminal appears in both G1 and G2 .We wish to combine the
symbols and productions of G1 and G2 to form a new grammar G, whose
language is the union of the languages of G1 and G2. The start symbol of G
will be S. All productions and symbols of G1 and G2 will be symbols and
productions of G. Which of the following sets of productions, added to
those of G, is guaranteed to make L(G) be L(G1) [union] L(G2)?

S → S1 S2 , S1 → ε, S → ε

S → S1 | S3 S2 , S3 → ε

S → S3 S4 , S3 → S1 | ε, S4 → S2 | ε

S → S1 , S1 → S2 , S2 → ε

https://docs.google.com/forms/d/e/1FAIpQLScqixtVoBnQlmkHZecVl35HT7uJ7sYScro8PM6PEhHA430Jtg/formResponse 5/7
12/07/2022, 14:53 Theory of Automata and Formal Languages (KCS-402) Quiz 11 (Properties of CFLs)- Time 30 minutes

Choose the correct answer * 1 point

Choose the correct answer * 1 point

https://docs.google.com/forms/d/e/1FAIpQLScqixtVoBnQlmkHZecVl35HT7uJ7sYScro8PM6PEhHA430Jtg/formResponse 6/7
12/07/2022, 14:53 Theory of Automata and Formal Languages (KCS-402) Quiz 11 (Properties of CFLs)- Time 30 minutes

Context-free languages are closed under: * 1 point

Union, Intersection

Concatenation, Kleene Closure

Concatenation, union, complement

Complement, Kleene Closure

Page 2 of 2

Back Submit Clear form

Never submit passwords through Google Forms.

This form was created inside JSS Academy of Technical Education, NOIDA. Report Abuse

Forms

https://docs.google.com/forms/d/e/1FAIpQLScqixtVoBnQlmkHZecVl35HT7uJ7sYScro8PM6PEhHA430Jtg/formResponse 7/7