Consider the following regular expression:
R 1 = aa ∪ (abb)
a) In your own words, describe L(R₁).
b) Following step-by-step the proof from class that shows that for every R, there exists an NFA M with L(R) = L(M), give a state diagram for NFA
M₁ with L(M₁) = L(R₁).
R 1 = aa ∪ (abb)
a) In your own words, describe L(R₁).
b) Following step-by-step the proof from class that shows that for every R, there exists an NFA M with L(R) = L(M), give a state diagram for NFA
M₁ with L(M₁) = L(R₁).