I understand that possible strings for this language is basically any combo of a's and b's, n times, with a's being even and at least 2 b's.
For the even a's I'm thinking of a DFA with 2 states and the initial state being accepting, that loops back to initial state when a is even. However when I mix this with the DFA that takes in 2 b's there is always a case where my DFA does not work, and accepts strings like "abb".
Any input on this?