Friday, December 5, 2008

Last post

Just finished Test 3. Unfortunately, I left it with some regret, as I ran out of time while writing again. I knew exaclty what I needed to write, if only I had 2 more minutes...

The typos on the cartesian product question led to quite some delay and confusion. I had to rerun through the process several times and didn't have enough time to check my final answer. I believe I wouldn't have ran out of time if there weren't any typo.

I always disliked it when ppl kept writing when the time's up, and I never ever did it myself. But I *might* (leaving it a bit ambiguous for obvious reasons) have been guilty of it this time.... I came in a bit late, some ppl didn't have the typo in their tests (doesn't justify anything, as there are also others' tests that had the typos).
========================

I went to Danny's office hr. My understanding of the pumping lemma and its application in the last post is incorrect. I'm glad I went.
========================

As I mentioned in my first post, I thought I disliked the theory part of CSC because it was of little value to my practical mindset, and that I was weak in the skills needed in theory. Also in my first post, I mentioned the possibility that this course might change my mind. Indeed it has.

This class, in combination with significant changes in my work ethic and overall responsibility, changed my mind to a very large extent.
Working with classmates also helped change my mind: I worked with fellow students who struggled.
I also worked with brilliant fellow students whom I'm sure are significantly smarter than I am. They also struggled (albeit for a shorter time, and understands almost instantaneously with explanation) on some topics. Interestingly, it is somewhat comforting and motivating to know that brilliant people also struggle to understand some topics sometimes.

The way Danny structures and teaches the topic is just fantastic - it really helped narrow the "gap" between my intuitive thought process and the rigorous theory topics. This was never done so well in any other course I've taken that had theory components.

I think that, besides providing us with greater understanding of the rigorous topics themselves, from the way this course is taught I've also learnt approaches that would allow me to work better with other theory topics -> a very valuable and well executed course.

I look forward to csc300 with Danny next term.
And since I've decided to go to Shanghai where my father is working, to spend time with my family this summer instead of taking summer courses, I hope I can catch another Heap course in the fall, intro to database hopefully.

Monday, December 1, 2008

Pumping Lemma, CFGs

The end of the term is very close. Time passes way too fast...

I realized that the pumping lemma could be difficult so I did some pre-reading before the lecture. Unfortunately, I still don't really get it after the lecture. The test is this friday, so I'm going to be going over it right after I finish this.

Unfortunately I think I'm also rather unclear, or have a lack of intuitive understanding of the regularity of a language. Is it generally any language that requires some "memory" to represent as a regex or FSA?

Context-free Grammars are interesting.
It's obvious that we've only seen the tip of the iceberg in this area, and I'm quite interested in how the theory can be extended and applied in practical usage. Unfortunately (or maybe fortunately,) I won't have to get too deep into this, as I'm not planning to take compilers or programming language courses.

***edit
After looking at the course notes and lecture notes. I find the lecture notes much clearer intuitively. But the course notes has great stuff too. With the combination of going through both I *think* I understand how proof of regularity by the pumping lemma works now.

For languages which have some pumping length for which the pumping lemma holds for all strings in the language, it is regular.
For languages which have arbitrarily large pumping lengths, and so no single pumping length works for all strings in the language, the language is not regular.

I hope that understanding is correct.