The reduced grammar equivalent to the grammar, whose production rules are given below, is:
S → AB|CA
B → BC|AB
A → a
C → a B | b

What language is accepted by the pushdown automaton?

Let:
L₁ = {0ⁿ1ⁿ0ᵐ | n ≥ 1, m ≥ 1}
L₂ = {0ⁿ1ᵐ0ᵐ | n ≥ 1, m ≥ 1}
L₃ = {0ⁿ1ⁿ0ⁿ | n ≥ 1}
Which of the following are correct statements?
A. L₃ = L₁ ∩ L₂
B. L₁ and L₂ are context-free languages, but L₃ is not a context-free language.
C. L₁ and L₂ are not context-free languages, but L₃ is a context-free language.
D. L₁ is a subset of L₃
Choose the correct answer from the options below.

Match List – I with List – II:

Choose the correct answer from the options given below:

Any string of terminals that can be generated by the following context free grammar (where S is start nonterminal symbol)
S → XY
X → 0X|1X|0
Y → Y0|Y1|0

Given below are two statements:
Statement I: The family of context-free languages is closed under homomorphism.
Statement II: The family of context-free languages is closed under reversal.
In light of the above statements, choose the correct answer from the options given below:

Consider the following statements about Context Free Language (CFL):
Statement I: CFL is closed under homomorphism.
Statement II: CFL is closed under complement.
Which of the following is correct?

The reduced grammar equivalent to the grammar, whose production rules are given below, is:
S → AB|CA
B → BC|AB
A → a
C → a B | b

Consider the grammar:
S → SbS | a
Consider the following statements:
The string abababa has
(A) two parse trees
(B) two left-most derivations
(C) two right-most derivations
Which of the following is correct?