0

I was wondering if this language is regular L={$a^{2m+k}b^{3n+l}c^{m+n}$ & $ k>2 $ & $ l \le 3$ & $m,n \in \mathbb{N}$} .I think the regular expression is :

$(aa)^*aaa(a)^*(bbb)^* \cdot ({e} \cup {b} \cup {bb} \cup {bbb} ) \cdot (c)^* $ .Am I correct?

Johnas
  • 21
  • 2
  • 2
    No. Any time you see a language where, for example, the number of $c$s that are allowed depends on the number of $a$s and/or $b$s that appeared earlier in the string, your intuition should be that the language isn't regular. DFAs can't remember arbitrarily large numbers so they can't compare the absolute number of $a$s, $b$s and $c$s. – David Richerby Aug 30 '17 at 11:49
  • And what's your question? – Raphael Aug 30 '17 at 13:34

0 Answers0