Question

The string WWR is not recognized by any FSM because _____________

(a) An FSM cannot remember arbitrarily large amount of information

(b) An FSM cannot fix the midpoint

(c) An FSM cannot match W with WR

(d) An FSM cannot remember first and last inputs

I have been asked this question in exam.

Query is from Finite Automata in chapter Finite Automata and Regular Expression of Compiler

Answer 1

The correct choice is (b) An FSM cannot fix the midpoint

To elaborate: Palindromes cannot be recognized by FSM.