0 votes 0 votes Let $A = \{ \langle{ R, S \rangle} \mid \text{R and S are regular expressions and} \: L(R) \subseteq L(S)\}$. Show that $A$ is decidable. Theory of Computation michael-sipser theory-of-computation decidability proof + – admin asked Oct 17, 2019 admin 123 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.