Slow and steady wins the race. Slow and steady. I don't know if that has anything to do with the topic(s) at hand, but writing it just felt right.
The course is fun again. I'm thoroughly enjoying the intuitive approach FSA-related problems need to be solved. Unlike recurrences and algorithm complexity and correctness proofs that are very rigid, FSAs are very open-ended. For example, the ability to choose useful loop invariants or pre/post conditions can only be learnt by repetition, and going through very similar algorithms over and over again. However, I have been able to solve a FSA-related problem on the first attempt. REGEX seem very much in the same vein as FSAs. They seem very clear
and easy to grasp, but I just have no idea what to expect in terms of
proofs relating to the concepts we've learnt about them so far.
So the signs are certainly encouraging. After an embarrassing algorithm-complexity-ridden midterm (lowest mark of my entire academic life, kindergarten included), I am really hoping to make a comeback in this course through A3 and the final. A3 is 50-50 split between FSAs (or is it DFSAs?) and algorithm correctness, so it is the perfect oppurtunity for me to practice my self-proclaimed profficiency in FSAs, and get completely comfortable with algorithm-related proofs in preparation for the final exam.
Let's hope all goes well.
