The problem I have is that for the language {a, b} I have to provide a regular expression that has an even number of a's and that does not contain the pattern aba.
I know that for an even number of a's the regular expression is
b*(ab*ab*)*
But I don't know how to make sure there is no pattern aba and how to combine the two.