regex and FSA

We're doing regular expressions in both csc236 and csc207! One interesting point that prof Heap brought up was that (empty set)* = empty string. This is a very non-intuitive and interesting. And I LOVE the material in this week's lectures because it very visual. I'm very eager to find out how to prove one of these graphs...

after the test

The test on Thursday wasn't too difficult. However, I realized that I made a mistake in the last question, of which the loop iteration is supposed to prove that the variables were natural numbers so that I could use the principle of well ordering to say that there is a lower bound to the set. Instead, I proved that the values in the loop iteration was always descending, which shows that the set is monotonic. However, I forgot that the principle of well-ordering presupposes that the set is of natural numbers. I doubt I'll forget this for the exam now... =.=

Before the test

It's only 3 hours before the test! Last week's lecture on loop invariance was a bit hard for me to follow, but it was fairly intuitive. I think I understand the concepts, but just need to touch up on the set of skills to express the concepts. However, I find it hard not to just memorize these... -.-