Formal Language and Automata

Formal language is largely different from the previous chapters, except the frequent use of induction. DFSA is a way to describe a language, and it is also of great fun because it reminds me of the puzzles I solved when I was in primary school. I think devising a DFSA is not difficult, because what you need to do is simply draw "0" lines and "1" lines and connect circles with those lines. But proving DFSA is a different story, for you must follow the format in the course notes like finding state invariants. Also problems related to DFSA can be very hard sometimes, the question 1 in Assignment 3 is not funny at all. I spent almost a whole week on that problem and finally got a right answer before the due time. I think automata will be a important part for the final exam, so I must work hard on that section. And no matter how hard the final exam would be, I must stay calm (just as the guy below) and try my best to conquer that.