Week Thirteen

Monday,
--------- Dec. 1, 2008

Today, we discussed "Push Down Automate"; the last topic in CSC236 this fall. The idea is very simple; how to express an FSA as a CFG. Each terminal is either \epsilon, or is preceded by one symbol.

Last week, we discussed examples of non-regular languages. Since these languages cannot be expressed by normal FSAs, we can use PDA to express them. We did an example of a language that has a similar number of 0s and 1s. The idea is to use stacks to determine how many 0s have been seen so far and compare them to the number of 1s.

Wednesday,
--------- Dec. 3, 2008
I could not attend today's lecture because I had a project for architecture due at 1 pm and I was working till 11 am (usual scenario). I am really thankful because Professor Danny posted the exam review approach on the bulletin board. I hope this will compensate for the lecture.
B the way, I did not know that professor's Danny's full name is Daniel. Very interesting :)

Friday,
--------- Dec. 5, 2008
We wrote test 3 today. Of course, today was the last day in school so I had like 4 assignments due plus this test. I did not study and I was not surprised to see that most students have not studied either. Anyway, I think the test was fair; I answered everything so I hope I will get a good mark. I thought there would be a question about pumping lemma and another question about proving DFSA invariant, but none of that showed up :)