Assignment 3 is all about regular expressions, and the material does not seem to be too difficult. I have started working on #2 and #3 and have outlined a layout to prove them. Regular expressions are pretty easy to understand, the only thing that was remotely difficult was understanding the kleene star. Once I understood that, most of the material was straight forward. Then we started to learn FSA's which were quite interesting. Every regular expression can be expressed by an FSA, and we learned how to create FSA's that expressed certain regular expressions. The hardest part about this was probably converting an FSA into a DFSA, because there were a lot of new concepts like delta and merging states. My understanding of how to crop out a state and replace it with a regular expression didn't take long though as this was quite straight forward.
The new material was not very difficult and quite easy to understand. I think I will do ok on the assignment 3 and term test 3 and hopefully go into the final exam with some breathing room.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment