I was given three DFAs to solve.
I understand the first one is a*. I think the second one would be b*(a+)*. I cannot figure out what the third one would be, it seems like there are too many different possibilities. The ones I came up with have too many conditions and it doesn't seem right. Is there an easy way to determine the language?
I got $((b+ab)(ab)^*(b+aa)+aa)(a+b)^*=(b+ab)(ab)^*(b+aa)(a+b)^*+a^2(a+b)^*$
There is a very famous technique called State Elimination Method to convert DFA's to regular expressions.