MAD 2104 Midterm: MAD 2104 FIU Exam f15k
Document Summary
Prof. s. hudson: simplify as far as possible: ((a b) ( a b)) (a b), let = {a, b, c} be an alphabet. 2b) let f = be the set of all such words of nite length, such as accbaccb. Let i be the set of all words (or sequences actually) of in nite length, such as accbaccba . Justify brie y, perhaps with a 1-1 correspondence or by discussing both cardinalities separately. You are not expected to repeat the proof of. Draw g (or ask me to do it, but at a cost of about 4 points). Justify your answer to this and the other parts of this problem below. 4e) is g isomorphic to w4 (the wheel with 5 vertices): de ne a set s recursively by. 5 s and 9 s and if x, y s then x + y 2 s.
