A3 and Test 3

Hello everyone, for those students reading this, good luck to you on the exam and lets hope for the best.

The third assignment wasn't so bad. For question three, which seemed really easy, was actually a bit tricky. It was the question where you had to prove that for any regular expression that is without a kleene star, it would denote a finite language. Well, I had the idea that if you prove that regular expressions, excluding the kleene star, is finite, then automatically the language is finite. It just makes sense. For example, if I proved that operations under regular expressions such as:

1) (a+a')
2)(aa')

are finite, then the language that uses those operations is finite. I used that idea in my assignment and made it fancy by using big words. Lets hope it works out =].

Anyways, test 3 is coming up and I am definately scared of DFSA's!! Its not just a scary name, its even a scary subject. I think if i spend some time reading online websites about the subject, it should help me out. I lost the course book, so i can't use that to help me out. I think it will be fine if I just read it over from the lecture slides and other sources. That will be my plan for test 3. More on the exam later. Bye bye.