MTH 210 Final: MTH 210 Final Exam 2007 Winter
Document Summary
Lg 06: verify that your paper contains 9 questions on 8 pages, you are allowed an 8 1. 2 11 formula sheet written on both sides: no other aids allowed. Use of scrap paper or additional enclosures is not allowed. If you need more space continue on the back of the page, directing marker where the answer continues with a bold sign. Use structural induction to show that every string in l ends in an b. Be sure to lay out your proof clearly and correctly. Page 3: find all trees with 5 vertices, up to isomorphism. Mk: find x when 4x + 1 3 (mod 7). Your answer should be an integer between 0 and 6. Mk (be sure to show all your working. ) Page 4: for the following fsa m , nd the language accepted by m . (give your answer as both a regular expression and in english. )
