Which of the following can accept even palindrome over {a,b}ans.Turing machinePush down AutomataNDFAAll of the mentioned Previous Marked for Review Next

The correct answer is Turing Machine.

Here's why:

1. A palindrome is a word, phrase, number, or other sequences of characters that reads the same forward and backward, ignoring spaces, punctuation, and capitalization. In the context of formal language theory and computer science, a palindrome is a string that reads the same forward and backward.

2. A Turing Machine is a theoretical machine that is used in thought experiments to explore the concept of computability. It is capable of simulating any computer algorithm, no matter how complex. It is particularly useful in accepting languages that require more than one stack or queue, such as the set of all palindromes.

3. A Push Down Automata (PDA) is a type of automaton that employs a stack. However, a PDA can only accept context-free languages. The set of all palindromes is not a context-free language, so a PDA cannot accept it.

4. A Non-deterministic Finite Automaton (NDFA) is a finite state machine where for each pair of state and input symbol, there may exist several possible next states. However, like PDA, NDFA also cannot accept the set of all palindromes as it is not a context-free language.

5. Therefore, among the options given, only a Turing Machine can accept even palindrome over {a,b}.