🎙 Free live masterclass · Sun, 29 Nov, 7:00 pm IST · Java Full Stack roadmap Register free →
Skills101
← Quiz: Turing Machines: all 10 questions

Quiz: Turing Machines · Question 3 of 10

Which language did the second TM accept that no PDA can?

Which language did the second TM accept that no PDA can?

  1. A.a^n b^n
  2. B.a^n b^n c^n
  3. C.Balanced brackets
  4. D.Strings ending in 01
Answer & explanation

Correct answer: a^n b^n c^n

a^n b^n c^n is not context-free, but the TM crosses off one a, b and c per pass.

Can you get the rest right without peeking?

Take the timed Quiz: Turing Machines quiz free. Pass it to earn XP and count towards your certificate.

Start the quiz →