Episode 10: Return of the Assignment (special appearance by regex)

Well, A3 is due in about a week, and I am looking forward to finishing the last of a series of demanding questions == Did relatively well in A2 (well...almost a 200% improvement to the first) so hopefully this good work streak continues.

This week we continued our discussion about regex, which I had previously found quite simple, so not much to whine about there...

However, DFSA machines are quite difficult to understand. To me it seems like its writing a whole lot of if-clauses in Java. Basically each transition state is like an if-clause. Designing DFSAs seemed simple at first but the fact that we have to do DFSAs for modulus numbers (such as numbers with remainder 2 or 3) and doing everything in binary (which is simple because it only uses 0 and 1 in the alphabet, but very difficult since I don't really know binary by heart and have to take forever to remember how to convert to a binary number) made everything quite tedious.