Regular expression for language containing odd number of a
Answers
Answered by
0
b*(ab*ab*)*ab*
the main part of it is (ab*ab*)*, which enumerate all possibilities of even number of as. then at last, an extra a has to exist to make it odd.
notice that this regular expression is equivalent to:
b*a(b*ab*a)*b*
please please please mark Brainliest if you are understand my answer
Similar questions