MTH 210 Final: MTH 210 Final Exam 2006 Winter
Document Summary
?last page 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. Page 2: consider the following (recursive) de nition of gurgle graphs: Show by structural induction that every gurgle graph has exactly two vertices of degree one. Page 3: for the following fsa, m , nd the language accepted by m . (give your answer as both a regular expression and in english. ) 1: let l = (a b) aa, the language of strings of as and bs which end in aa. Give the state diagram of an fsa m , with fewer than 5 states, such that l(m ) = l.
