regular expression

Question

write the regular expression for the given language

L= { W | NO OF  a mod 2= 1}  (odd no of a's )

Answer 1

{(b*ab*ab*)*+b*}ab*

or

b*a{(b*ab*ab*)*+b*}

and for even no. of a = (b*ab*ab*)*+b*

Comments

@LeenSharma,@Arihant  

sorry u r correct

---

it is being accepted.

---

This is the most appropriate method. i.e. create a RE from the DFA.

Answer 2

assuming set of input symbols a,b ans is:b*a(b*ab*a)*b*

Comments

only b should also be in language rt ..which will not be get from it .

---

@sid1221  
only b means 0 no.'s  of a
but 0 no.'s of a is not odd no. of a

---

yes you are right .. my bad i did mistake ,

@aik you cant derive aaba from your expression right ...

here people dont want to correct mistakes just want how to downvote someone ...

anyway@aik i think you will get ur mistake :)