Question

Regular Expression for the following Language,

$$\begin{align*} L = \left \{ a^{m}b^{n}\; | m \geq 1,n \geq 1,mn \geq 3 \right \} \end{align*}$$

Comments

i think this must be re

Answer 1

Minimal strings of above language are : $\color{green}{aaab, aabb}$ and $\color{green}{abbb}$ as minimal value of $m$ and $n$ is $1$, and also $mn \ge 3$.

Minimal pairs of $m$ and $n$ that satisfy above constraints are: $(m,n) = (1,3), (3,1)$ and $(2,2)$

So, RegExp would be : $\color{maroon}{aa^*bbbb^* + aaaa^*bb^* + aaa^*bbb^*}$

Comments

grown up !! Still a lot to learn from you :)

---

Guys 

After reading all ur comments on the amount of interest you are taking on editor instead of the question 

I think we need to change the name of the forum from gate Overflow to online editor Overflow 

 

---

Hey bhargv..there is a min dfa in the comment..any comment on that ?