Question: Consider the language L _ {w E {a,b)' : the longest run of a's in u, is longer than any run of b's in w}

Consider the language L _ {w E {a,b)' : the longest run of a's in u, is longer than any run of b's in w} For example, abbbbaabbbaaaaa E L because the longest run of b's in it has length four, while the longest run of a's has length six. Prove that L is not context-free
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
