I think I finally can grasp the usage and idea behind regular expressions now, so I think this will propel me quickly in understanding the lecture.
Today's class is rather interesting - more deterministic finite state automata, it was so interesting that I might just search for the same program that Danny used in the class today and the previous lesson before that.
But the darker side, I'm still a bit confused about the definition of language and a set of alphabets (afterward when I'm doing my problem set 5 I finally understand the difference between them), so there's hopefully no problem with this topic from now on. All I need is to spent time wisely and catch up with my work.
1 comment:
Send me questions if the course notes and slides don't clear up the definitions.
Post a Comment