-1
$\begingroup$

I need to show that the following language is context free:

$$L = \{a^\ell b^n c^m | \ell, n, m \in \mathbb{N}^+ \wedge ((\ell \ge n) \vee (\ell \ge m))\}$$

New contributor
louis_02 is a new contributor to this site. Take care in asking for clarification, commenting, and answering. Check out our Code of Conduct.
$\endgroup$
  • 1
    $\begingroup$ Also asked at Math.SE. Please do not cross-post questions, especially ones that already have answers on another site. $\endgroup$ – Aaron Rotenberg 2 days ago
1
$\begingroup$

Hint 1: $L = L_1 \cup L_2$ for some $L_1$ and $L_2$ which are obviously context-free.

Hint 2:

$L_1 = \{a^\ell b^n c^m | \ell, n, m \in \mathbb{N}^+ \wedge (\ell \ge n)\}$

$\endgroup$

Your Answer

louis_02 is a new contributor. Be nice, and check out our Code of Conduct.

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.