329 views

Use the procedure described in $\text{Lemma 1.55}$ to convert the following regular  expressions to non-deterministic finite automata.

1. $(0\cup 1)^{*}000(0\cup 1)^{*}$
2. $(((00)^{*}(11))\cup 01)^{*}$
3. $\phi^{*}$
| 329 views

a. (0+1)*000(0+1)*

b. ((00)*11+01)*

c. ϕ*=ε

by
edited by