# Regular expression of a given language [closed]

Could somebody please confirm if a regular expression of language: $$L := \{b(ab)^n a^m \mid n, m \geq 0\}$$ is $$\{b, (ab)^* a^*\}?$$

And if not, could somebody please tell me why?

• How is $\{b,(ab)^*a^*\}$ a regular expression? Commented Mar 15, 2016 at 19:48
• Possibly related to/duplicate of this and/or this. Commented Mar 15, 2016 at 20:16
• This question appears to be unsuited for this site because questions of the form: "This is the exercise problem, this is my solution. Please grade!" are not interesting for anyone but you. Please see this related meta discussion. If you want to ask a specific question about a specific part of your attempt, please edit the question accordingly and it may be reopened. Otherwise, you might want to visit Computer Science Chat and get some feedback there. Commented Mar 15, 2016 at 22:50

In short, your answer is No. For explanation about Regular language and Regular expression, you can check this link. And the correct answer to your question would be: $b(ab)^*a^*$