Question

constract nfa for the regular language 0^+ 1^+​

Answer 1

Answer:

To construct a DFA M = (Q′, Σ,δ′,q′. 0. ,F′) that is equivalent to NFA N, first we compute the ε-closure of every subset of Q = {1, 2, 3}. Set R ⊆ Q ε-closure E(R). ∅.