Date: This Friday
Today we moved on to what we do best, proving that the context-free grammar works. The one grammar we are proving in the lecture denotes the set of binary strings having the same number of 0s and 1s.
The proof itself is not hard, but extremely long (just like proof of correctness and the proof of the DFSAs/NFSAs). Not to mention the random Intermediate Value Theorem jumping in out of nowhere to save the day (it works perfectly with this proof), that really surprises me.
I'm still enjoying my relatively free week to study before the exam storm brew, 4 consecutive exams, with my first two exams (back-to-back - right after each other) on the first day.
Oh, scratch that! I'll have to find time in the midst of studying to do well in the third test/think up a problem solving question for this Slog, not to mention 207 project in its final phase... there's still quite a lot of things to keep me busy these days...
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment