Week 10

I find this week's topic very interesting. The DFSA is like a handwritten program to verify whether a binary string is of the form that the user wants. I never thought that something like this can work. It's quite neat to come up with a machine yourself. It will be great to know in what situations can this be used though.

-Problem set 5-
In order to prove this, you need to understand that whenever you add a new string to the language, you can add the regular expression that denotes the new string to the regular expression that denotes the language (R_L + R_newstring).