contestada

a. (10) let palindromedfa be the language of all encoded dfas that accept sr if they accept s. prove that palindromedfa is a turing-decidable language.