Date: Friday
Apparently I'm not good at keeping track, it is now Sunday (when I'm writing this).
Today lecture is similar to the lecture we did a few weeks ago regarding how PWO, PCI and PSI relates to each other, we started first by deriving a regular expression given a DFSA, and show that how regex, NFSA, and DFSA also has very close relationships with each other.
I still have trouble grasping the purpose of epilson transitions in NFSA, is it just some kind of a placeholder?
I haven't started working on assignment 3 yet, I looked at it a long time ago, thought about it, but haven't written any conceivable proofs regarding it. It doesn't seem that hard, I just have trouble formulating the definition of the Kleene star (question 3) in the head, and how I should go about to prove it. Right now, I'll take a rest - a brain's always clearer when you're not tired.
No comments:
Post a Comment