Week 13

This week was madness!! Presentations, Essays, Tests, and 3 finals in a row in the following week. I did not make it to the Monday class, and I dont think I will make it to Wednesday. Hope the test on Friday won't be too bad.

Week 12

We looked at non-regular expressions and the pumping lemma. We looked at the proof of the pumping lemma, and then were introduced to grammars. Finally, we incorporated languages, grammars, and all the symbols we have seen so far into several problems such as proving languages of grammars, etc...

Week 11

We got introduced to NFSAs, and also how to construct a DFSA that is equivalent to a NFSA. We also looked at how there will be an FSA for every regular expression. Finally, we looked at the cartesian product of two machines.

Week 10

We continue with regular expressions. Monday we discussed the laws for regular expressions, and were introduced to DFSA. The computer program I saw was clear to understand. All the laws such as associativity, distributivity, and commutivity were logical since we witnessed them in other courses as well as CSC165, so there was nothing surprising about them.

Week 9

Started Formal languages. In the two lectures of this week, the amount of new terms we learned suprised me. Alphabet, languages, Kleene Star, all the operations of regular expressions, and even regular expressions as a topic of its own was new to me. I had to go through the lecture notes several times and do the proofs many times over and over in order to understand everything. The test on Friday I thought was ok, it was reasonable in difficulty for those who did the assignment and problem sets.

Week 8

In class, we looked at examples of loops and how to prove them using induction. First it was basic, then got brutal.