post assignment thoughts

regarding question 2c, I have made a mistake in my proof by assuming that all languages with an even number of ones will be in the set of 2c. Apperently this is not so. language r3 is unable to produce languages that does not contain no ones (which contains an even number of ones) consider the example 0. This language has a even number of ones, however, it cannot be produced by any languages denoted by (0(10*1))*. This is because the ones in this language nessessarily exists. Unfortunately, since i proved the question from using language of even ones, my prove could not cover the described sets.

But I loved drawing the diagrams for DFSA