WEEK #10

Week 10's lectures began with a build up on regular expressions (regexps) which were introduced last week. There were more discussion on the equivalency of regexps and the types of algebra that can be performed on them. Then there was a smooth transition into Deterministic Finite State Automatas (DFSAs) which are machines that can be used to verify the correctness of inputs. These machines have starting states, normal states, and accepting states along with transitions which moves from one state to another depending on the next character of the input. The first formal example that was shown in lecture was a DFSA which accepted binary strings that were multiples of 3 in base 10. I really liked regular expressions but becoming very interested in DFSAs as well, and the good thing is that both topics intertwine so you get the good of both worlds.