← 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?
- A.a^n b^n
- B.a^n b^n c^n
- C.Balanced brackets
- 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 →