0 votes 0 votes Give English descriptions of the languages of the following regular expressions$:$ $(1+\in)(00^{*}1)^{*}0^{*}$ $(0^{*}1^{*})^{*}000(0+1)^{*}$ $(0+10)^{*}1^{*}$ Theory of Computation ullman theory-of-computation finite-automata regular-expression + – admin asked Apr 3, 2019 • edited Apr 5, 2019 by Lakshman Bhaiya admin 246 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.