1 votes 1 votes Prove or disprove each of the following statements about regular expressions. $(R+S)^{*}=R^{*}+S^{*}$ $(RS+R)^{*}R=R(SR+R)^{*}$ $(RS+R)^{*}RS=(RR^{*}S)^{*}$ $(R+S)^{*}S=(R^{*}S)^{*}$ $S(RS+S)^{*}R=RR^{*}S(RR^{*}S)^{*}$ Theory of Computation ullman theory-of-computation finite-automata regular-expression + – admin asked Apr 3, 2019 edited Apr 5, 2019 by Lakshman Bhaiya admin 1.3k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.