0 votes 0 votes Let $PAL_{DFA} = \{ \langle M \rangle \mid \text{ M is a DFA that accepts some palindrome}\}$. Show that $PAL_{DFA}$ is decidable. (Hint: Theorems about $CFLs$ are helpful here.) Theory of Computation michael-sipser theory-of-computation finite-automata decidability proof + – admin asked Oct 17, 2019 • retagged Oct 17, 2019 by Lakshman Bhaiya admin 324 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Its is decidable because the language is Context Free and is accepted by a PDA. Sanandan answered Sep 1, 2020 Sanandan comment Share Follow See all 0 reply Please log in or register to add a comment.