12th Week - SLOG

Assignment 3 was due on Monday night, and still our group couldn't figure out the very last question. DFSA wasn't not my specialty, but since other members were busy with error corrections and putting the answers together with nice and neat copy, I was mainly in charge of the question #4. With help of TAs and peers, I could set up two different DFSAs, one deals with odd length of binary strings, and the other deals with multiples of 5 and found the intersection DFSA of those two DFSAs. It was difficult to define the DFSA just by wording, but I think I had fully explained how it operates.

Week 13, will be my worst week in the term, there are 3 assignments and 2 tests waiting for me.
Hope there won't be any overnight staying at BA, but it is much more likely to be happened.
I feel blurry about NFSA, but this time, I will be prepared before the test.

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.