In the last week two weeks of class, Professor Heap talked more about Finite State Automata and Languages--specifically about Deterministic FSA, Non-Deterministic FSA, State Elimination, etc. I didn't quite understand the difference between Deterministic FSA and Non-Deterministic FSA at first because I didn't even know what "deterministic" means in this case. Anyhow, I studied from the slides, and the examples presented in class really helped. Also, I found the last two tutorials very helpful--the exercises were really intuitive and so the quizzes seem so easy.
The last assignment was kind of tricky. I didn't spend too much time on the first two assignments, but I somehow got stuck on the second question. I didn't know clearly understand the hint for this question, so I tried to prove a bunch of different loop invariants to refer to when showing termination. So I sent an email to ask Professor Heap about the question, and I managed to finish it like 10pm on the due date. What a relief.
