week 12 - A3/ Non-Regular Languages Pumping Lemma

A3 was due this week. For me, it seemed as if i managed to find a counter example for all parts of Q2. It seems like there is at least 1 regex that did not exist in the language. It can't possibly be all false. Don't think A3 will go as well now. And as for the DFSA question, it's a pain to have to type the notations. I didn't even know if my notations are correct of what format the question wanted. How do u draw a picture of the DFSA using .txt? Oh man...i must be missing something here. Pen and paper please!!!