It's all over (I guess?)

Bad day, bad day, bad day >_<

First, there's phase 3 for the 207 project due in the morning, second, there's stat problem set to hand in, third, assignment 3 for this course. I have to cope through the whole day with massive sleep deprivation.

Back on topic, today we learn the definition of non-regular languages, what surprises me the most is the fact that there are more non-regular languages than regular languages, as well as the fact that the alphabet we are using (binary digits of 0 and 1) was not even regular at all!

As well, the pumping lemma. I also raise the question about the "lemma" alongside with Danny, because to me it seems very important in this topic. The pumping lemma is useful to determine whether a language is regular or not, as well as its simplicity, both in diagram and definition. I also find it rather funny how you can "pump" a language to make it irregular.

Now that most of the workload is done, with two more weeks to go, I'll catch up on the study, get more sleep, and prepare for the final exams during December.