adplus-dvertising
frame-decoration

Question

Which one of the following statement is FALSE?

a.

Context-free languages are closed under union

b.

Context-free languages are closed under concatenation

c.

Context-free languages are closed under intersection

d.

Context-free languages are closed under Kleene closure

Answer: (c).Context-free languages are closed under intersection

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Which one of the following statement is FALSE?

Similar Questions

Discover Related MCQs

Q. Which of the following strings is not generated by the following grammar?

S → SaSbS|ε

Q. The production Grammar is {S->aSbb,S->abb} is

Q. A language L from a grammar G = { VN, Σ, P, S} is

Q. A regular language corresponds to

Q. Given the language L = {ab, aa, baa}, which of the following strings are in L*?

1) abaabaaabaa
2) aaaabaaaa
3) baaaaabaaaab
4) baaaaabaa

Q. Which is a correct statement?

Q. Which grammar is not regular ?

Q. Here is a context-free grammar G: S → AB A → 0A1 | 2 B → 1B | 3A . which of the following strings are in L (G)?

Q. The parse tree below represents a rightmost derivation according to the grammar S → AB, A → aS|a, B → bA. Which of the following are right-sentential forms corresponding to this derivation?

Q. The grammar G: S → SS | a | b is ambiguous. Check all and only the strings that have exactly two leftmost derivations in G.

Q. For the following grammar, Identify all the unit pairs.

S → A | B | 2 A → C0 | D B → C1 | E C → D | E | 3 D → E0 | S E → D1 | S

Q. Which of the following is not regular?

Q. If L1 and L2 are regular languages is/are also regular language(s).

Q. If P & R are regular languages and also given that if PQ=R, then

Q. Which of the following conversion is not possible (algorithmically)?

Q. Recursively enumerable languages are not closed under:

Q. Grammar that produce more than one Parse tree for same sentence is:

Q. Automaton accepting the regular expression of any number of a ‘ s is:

Q. Grammars that can be translated to DFAs:

Q. The language accepted by a Push down Automata: