Consider the language L_R = { | D is a DFA and D accepts w^R if and only if D accepts w}. (Recall that denotes a standardized description of the deterministic finite automaton D as a string, and that w^R denotes the string w in reverse order. For example, if w = abcaabb, then w^R = bbaacba. Show that L_R is Turing-decidable. You don't know how to explain please leave my question unasnwered. I don't need to print screen from a sinikr questions