I am currently working on assignment 3 and am not finding it too difficult (although I've retracted that statement in the past on previous assignments). There doesn't seem to be any questions that are very abstract and that would require many hours of laboring (ahem, a2 question 1). Or maybe I am just becoming more comfortable with induction proofs (hopefully!).
I've studied the course notes for regular expressions quite a bit now and find them to be fairly intuitive. We've already encountered a few questions in the course involving strings, but I suppose now it is simply more formal, together with different sets of alphabets.
For problem set 5, it asked to prove that for a finite set of strings there would be a regular expression that would denote the respective language. For my answer I first showed that it would be defined over some finite alphabet and then showed that by definition there would then be a regular expression to denote that alphabet. Now thinking back, it may have been good to give more details about the first step of the proof and actually show by induction that there would be a finite alphabet.
No comments:
Post a Comment