Name: ____________________________________________________ Alpha: _____________________
Describe help received: _________________________________________________________________
Use the two algorithms from this lecture to get rid of all the
λ-transitions in this machine. In other
words, produce a
diagram of a nondeterministic finite automaton with no
λ-transitions that accepts the same language as the
Note: show the machine as it appears after each step!