York University Eecs 2001 Intro To The Theory Of Computation

0 Comment

Problem 3
[5 points] Let E = {0, 1}. B is a language over alphabet E U {#} defined as below. Using the Pumping
Lemma, prove that B is not a CFL.
B = {u#v#wu, v, we gt;* , u is a substring of w}Engineering Technology