This has been confusing me for a while, how do we exactly choose the pumping length when we want to prove whether a language is CFL or not. For example, when we want to prove that {ww, w: {0,1}* } why do we choose p = n as 0^p 1^p 0^p 1^p ?
Asked
Active
Viewed 16 times
