0 votes 0 votes Use the procedure described in $\text{Lemma 1.55}$ to convert the following regular expressions to non-deterministic finite automata. $(0\cup 1)^{*}000(0\cup 1)^{*}$ $(((00)^{*}(11))\cup 01)^{*}$ $\phi^{*}$ Theory of Computation michael-sipser theory-of-computation regular-expression finite-automata + – admin asked Apr 21, 2019 admin 6.2k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes a. (0+1)*000(0+1)* b. ((00)*11+01)* c. ϕ*=ε aditi19 answered May 25, 2019 edited May 25, 2019 by aditi19 aditi19 comment Share Follow See all 0 reply Please log in or register to add a comment.