Week 11

We got introduced to NFSAs, and also how to construct a DFSA that is equivalent to a NFSA. We also looked at how there will be an FSA for every regular expression. Finally, we looked at the cartesian product of two machines.