Answer Happy

Draw state-transition diagrams for each of the following finite state machines based on the attached Cayley table. + i a b с d i d 600 a C e 60 b f O 09 с (a) The finite state machine whose associated monoid matches the table. (Hint: use multiplication on the left by a, b, or c as your input set] (b) The finite state machine whose states are the elements in the Cayley table to the right, but use conjugation by a, b, or c as the input set. For example, applying conjugation by a to e gives Ca(e) = a-lea. (Hint: determine the inverses first] i a a d b 8 с b d e e i f С g f b с с f d a e d f g g b i e a i 09 g i e f g e f g i g b с i e f a i a b с d с f 8 d a b e d d 000 e a P. 09 f b = 60 с