← Quiz: Turing Machine Traces: all 10 questions
Quiz: Turing Machine Traces · Question 10 of 10
Which machine could check palindromes in O(n) moves?
Which machine could check palindromes in O(n) moves?
- A.A DFA
- B.A one-tape TM with more states
- C.A two-tape TM that copies the input and compares it backwards
- D.No machine
Answer & explanation
Correct answer: A two-tape TM that copies the input and compares it backwards
Multi-tape TMs recognise the same languages but can be much faster.
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 →