← Quiz: Pumping Lemma Proofs: all 10 questions
Quiz: Pumping Lemma Proofs · Question 10 of 10
Which of these languages IS context-free?
Which of these languages IS context-free?
- A.{aⁿbⁿcⁿ}
- B.{ww | w ∈ {a, b}*}
- C.{wwᴿ | w ∈ {a, b}*}
- D.{a^(n²)}
Answer & explanation
Correct answer: {wwᴿ | w ∈ {a, b}*}
A PDA can push the first half and pop while matching its reverse; the others fail the CFL pumping lemma.
Can you get the rest right without peeking?
Take the timed Quiz: Pumping Lemma Proofs quiz free. Pass it to earn XP and count towards your certificate.
Start the quiz →