Consider the following NFA (M1) over the alphabet Σ = {0, 1}: * Attached Image * Two automata M1 and M2 are said to be equivalent if L(M1) = L(M2). In other words, two machines are equivalent if they...

Consider the following NFA (M
₁) over the alphabet Σ = {0, 1}:

* Attached Image *

Two automata
M
₁
and
M
₂
are said to be equivalent if
L(M
₁) =
L(M
₂). In other words, two machines are equivalent if they accept the same string and reject the same strings.

Create a new NFA
M
₂
that is equivalent to
M
₁
but does not use any empty (?) transitions. Hint: Define the transition function by
δ: Q x Σ -> ?(Q)