Palindromes can't be recognized by any Finite State Automata because:
You need to understand that FSA means finite state automata and hence they have a very little memory to keep track of last input .
Palindrome problem requires two basic constraint
Now FSA cannot do either of them and hence option D is most suitable .
64.3k questions
77.9k answers
244k comments
80.0k users