This past tutorial was intriguing, we were taught how to reduce a DFSA to its 2 state form. I found it extra intriguing how such a simple worded language could have generated such a complex regular expression. I used the tutorial quiz question from before to write up a step-by-step solution for changing a DFSA to a regular expression.
No comments:
Post a Comment