0
$\begingroup$

I am learning about regular expression, and trying to describe a regular expression for the language L

$\qquad L = \{a^i b^j c^k \mid i+j = k\}$

What is the right approach and how to describe a regular expression like this?

$\endgroup$
3
  • $\begingroup$ What do you mean by "describe"? Natural language or something else? $\endgroup$ – phan801 May 25 at 13:02
  • 1
    $\begingroup$ But L needs to be regular if you want to describe it via a regular expression. $\endgroup$ – Ran G. May 25 at 13:11
  • $\begingroup$ To reiterate the other responses, there is NO POSSIBLE regular expression to describe language $L$, since it's not a regular language. Welcome to the site, by the way. $\endgroup$ – Rick Decker May 25 at 13:17
2
$\begingroup$

It seems I didn't understand the question.

There is no regular expression for this language because it is not regular. You can prove it using the pumping lemma.

$\endgroup$
1
  • $\begingroup$ @0xAlon I edited the answer. $\endgroup$ – Nathaniel May 25 at 13:14

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.