MTH 210 Final: MTH 210 Final Exam 2005 Winter
Document Summary
This exam has 6 pages including this front page. It consists of 3 parts and is worth 25% of the course mark. Please answer all questions directly on this exam. One 8. 5" by 11" double-sided crib sheet is allowed, but no other aids are. If you need more room for the solutions, please continue on the back of the page and indicate. Part a regular expressions and finite state automata. Part a regular expressions and finite state automata 20 marks. Let l1 be the language of the binary representations of all positive integers divisible by 4. Let l2 be the language of the binary representations of all positive integers not divisible by 4. None of the elements of these languages have leading zeroes. Please note that all the questions in this part of the exam are related, but it is possible to answer them independently.
