What is a regular expression for $L_1=\{a^{2n} b^{3m+1} \mid n \geq 1, m \geq 0\}$?
Asked
Active
Viewed 44 times
-1
-
1What have you tried? Where did you get stuck? We're not here to do your homework. – Yuval Filmus Apr 11 '16 at 06:48
-
I tried. My answer is a(aa)b(bbb) – Jake Apr 11 '16 at 07:50
-
That's almost correct (the powers of $a$ are a bit off). Next time have more faith in yourself. – Yuval Filmus Apr 11 '16 at 07:51
1 Answers
0
Hint: Write $L_1$ as a concatenation of two languages: $\{ a^{2n} \mid n \geq 1\}$ and $\{b^{3m+1} \mid m \geq 0\}$.
Yuval Filmus
- 276,994
- 27
- 311
- 503