I was pretty happy with Test 2. So hopefully that feeling stays once I get the mark back as well. I'm just a bit worried about question 3. I'm not sure my loop invariant was correct; and didn't really use it as part of my proof like I probably should have.
Today we continued working with Formal Languages and Regular Expressions. So far things have been fairly simple; regarding the operations and definitions. Just the klene star (*) has been a tad confusing so far. We also saw an interesting example of the regular expressions in the form of a finite state machine.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment