NFSA

Just had the term test today. It went better than I expected since I wasn't too prepared on NFSAs. I got lucky there wasn't a question on it. There was one question on DFSAs which was fairly easy since no proof was required. The second and the third question were about regular expressions and those I have had enough practise with and didn't trouble me much at all.
I took a look at NFSAs after the test however and it doesn't seem as bad as I had thought. Apparently they are equivalent to DFSAs, but a lot simpler to construct and deal with. My main concern was those seemingly "random" choices that are allowed to be made. But now I see that it's just a different form of expression and it's not like a computer randomly chooses one. It's just different allowed paths that can be taken. For some reason NFSAs actually seem more familiar to the more tangible handling of the regular expressions that we did in CSC207. Anyways it looks like I'm not too badly prepared for next week. I just need to look through NFSAs a little more in depth and also take a look at the Pumping Lemma and I should be set for the exam.
This is my last blog post for this course I suppose. I wasn't exactly jumping for joy about this course in the beginning since I'm more into algorithms that are a little more practical than the purely theoretical side of computer science, but I actually quite enjoyed it and I must say it has made me more curious about what CSC263 has in store. Danny was an excellent prof and I hope I get to take a class by him again.