I've started studying for the exam and also getting ready for test 3. I was surprised to learn that test 3 was going to be only on regular expressions (ch7) and not on context free grammars (ch8). But I guess ch8 will be saved for the exam.
I'm finding languages to be very interesting, especially with context-free grammars being tied in with programming languages. I find that the automata models that are presented offer a good visualization of what strings may be accepted within a specified language. I imagine that this has big implications within computer science, given that much of it deals with parsing certain regular and non regular languages.
For the exam, I plan on looking through past exams and working through those problems. Right now, I feel confident about general induction proofs (ch2), as well as correctness proofs. I need a bit of work with languages, in order to feel confident. I'll probably feel better after having studied for test 3.
After looking at the partial solutions for A3, I'm curious as to how my question 4 will be marked. On the solutions, there are only 5 states; but for my solution I had 10 states. I still think my solution works, but I guess that having fewer states would probably be a better solution. I wonder how it might be marked, and if there will be deductions.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment