Week 11 and 12

Weeks 11 and 12 I'm sure were busy for everyone. As the semester draws to a close, students have assignments, essays and tests to do, and professors and TA's have stuff to mark.

Week 11 we saw a lot of NFSAs and equivalence. There was some tricky stuff to learn regarding the state invariants, and transition functions. We talked a lot about epsilon transitions, subset construction and equivalence. It was interesting to see the equivalence of the regular expressions and FSA.

Week 12 we looked at the pumping lemma. It became a useful tool to use to show that a language isn't regular. We used it in some examples; one which showed that the language of binary strings with equal number of 0's and 1's.

And finally we started to talk about the final exam and completed TA evaluations.