11th Week - SLOG

This week, we continously had learned the concept of FSA. This time, in addition to DFSA, NFSA was introduced. From the lecutre, we saw that a regular DFSA is a special case of an NFSA and for every regular expression, there's an equivalent NFSA.

There was also the last problem set due on Friday's lecture and it was very simple, since we had went over a similar example from last week's lectures. Just by looking at it, L(((0+1)(0+1))*(0+1)) was for sure, binary strings of odd length , because addition of 1 to multiples of even length always equals odd length, and the regular language was only consisting of 0s and 1s, which is a definition of binary language.

Rough copies of Question #2 from A3 was prepared, earlier than what I had thought, because the questions had very similar concept to the problem set, which dealt with the regular expressions. I will continue to work on A3 over the weekend.