Name: ____________________________________________________ Alpha: _____________________
Describe help received: _________________________________________________________________
Problem 1
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
machine below.
Note: show the machine as it appears after each step!
I.e. your solution should look like
"after step 1 <drawing>, after step 2 <drawing>, ...".
