Finite Automata, Part III

Today we see how to tranform NFAs into DFAs and how changing a machine can transform a language.

Readings

• Readings: Guide to the Subset Construction

Links

• Condensed Slides.pdf
• Lecture Slides.pdf
• Lecture Video
• Q&A