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

Quiz: Turing Machine Traces · Question 5 of 10

Why can the palindrome language not be recognised by a DFA, but can by a Turing machine?

Why can the palindrome language not be recognised by a DFA, but can by a Turing machine?

  1. A.Palindromes are finite
  2. B.A DFA cannot remember the whole first half, but a TM can go back and forth and erase matched symbols
  3. C.A DFA cannot read the letter b
  4. D.A TM has more states
Answer & explanation

Correct answer: A DFA cannot remember the whole first half, but a TM can go back and forth and erase matched symbols

The TM uses its tape as unlimited memory; the DFA has only a fixed number of states.

Can you get the rest right without peeking?

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

Start the quiz →