L = {ai bj ck | i = j = k or i > 1000}
Lets divide this into 2 languages
L1 = {ai bj ck | i = j = k} and L2 = {ai bj ck | i > 1000}
Now clearly L1 is CSL and L2 is regular.
$\therefore$ L = L1 $\cup$ L2 , which will again be a CSL.
64.3k questions
77.9k answers
244k comments
80.0k users