Given the alphabet $  = \{a, b\}$ construct a FSA for the following language:$$ L=\{^*  ||a =even  ||b =odd\}$$where $||x $ is the number of occurrences of $x$ in $$.Basically, only strings where the number of $a$'s is even and the one of $b$'s is odd.My attempt was the following:whereas that's the solution of my teacher:I wonder if mine is correct, too. I tried to follow the paths and I think that mine is working.
Is the FSA for that language right? Comparison between two solutions
formal languages;finite automata