Date: Monday
Hmm... seems like I forgot, I was busy studying for other courses.
Ah, December, the last week of university, the last week of brain torture, the beginning of a holiday.
The projector is not working again, so back to old fashion chalk-and-blackboard teaching. Today we relate the similarity between context free grammars and finite state automata, then finally show what we couldn't do in FSA (a binary string with the same number of 0s and 1s) by adding memory (a.k.a stacks) onto a similar looking FSA - the PDA! - to make it work.
I was quite relieved to find out that they are extremely similar, guess I don't have to worry about not understand it, because I can study off FSA with a few slight changes and a few more objects added to it. However, I do have to begin preparing for test 3, in the midst of me studying for other courses as well.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment