Provide a polynomial time algorithm that decides whether or not the language recognized by some input DFA consists entirely of palindromes


Everything needed to know is in the question statement. I believe that the DFA has to be acyclic (meaning its language is finite), which can be checked in polynomial time. However, finding all paths from the start state to an accept state can run in exponential time in worst-case.