0 votes 0 votes We developed the regular expression $(0+1)^{*}1(0+1)+(0+1)^{*}1(0+1)(0+1)$ Use the distributive laws to develop two different,simpler,equivalent expressions. Theory of Computation ullman theory-of-computation finite-automata regular-expression descriptive + – admin asked Apr 3, 2019 • edited Apr 5, 2019 by Lakshman Bhaiya admin 483 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.