edited by
896 views
2 2 votes

Find the minimum string generated by the below Regular Expression.

  1. $\left(\left(ab\right)^*a^+\right)^+bb^+aa^*$
  2. $\left(\left(ab\right)^+aba\right)^+aaa$
  3. $\left(aaa^*aba^*\right)^+$
  4. $\left(a+aa+aaa\right)^+$
  5. $a^+b^+$
  6. $a^*b^*$
  7. $\left(a^*b^*c^+\right)^+$
  8. $(a+b+\epsilon)^+$
  9. $\left(\left(a+ab\right )aa+aa\right)^+aaa$
  10. $\left(ab \cdot aaa \cdot a + a^* \right)^+$

1 Answer

Position:
Show:

Related questions

1 1 vote
1 answers 1 answer
3.4k
3.4k views
Hari asked May 6, 2017
3,410 views
Consider the following GrammarS - Ax/ByA->By/CwB->x/Bwwhich of the regular expression describe the same set of strings as the grammar? The option are:(a) xw* y + xw* yx +...