0 votes 0 votes Let $S = \{\langle M \rangle \mid \text{M is a DFA that accepts}\: \text{ $w^{R}$ whenever it accepts $w$}\}$. Show that $S$ is decidable. Theory of Computation michael-sipser theory-of-computation decidability proof + – admin asked Oct 17, 2019 • edited Oct 17, 2019 by Lakshman Bhaiya admin 128 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.