Theory of computation - Using the pumping lemma for context free languages

Posted by Tony on Stack Overflow See other posts from Stack Overflow or by Tony
Published on 2010-04-11T16:14:57Z Indexed on 2010/04/11 16:43 UTC
Read the original article Hit count: 343

I'm reviewing my notes for my course on theory of computation and I'm having trouble understanding how to complete a certain proof. Here is the question:

A = {0^n 1^m 0^n | n>=1, m>=1}  Prove that A is not regular.

It's pretty obvious that the pumping lemma has to be used for this. So, we have

  1. |vy| >= 1
  2. |vxy| <= p (p being the pumping length, >= 1)
  3. uv^ixy^iz exists in A for all i >= 0

Trying to think of the correct string to choose seems a bit iffy for this. I was thinking 0^p 1^q 0^p, but I don't know if I can obscurely make a q, and since there is no bound on u, this could make things unruly..

So, how would one go about this?

© Stack Overflow or respective owner

Related posts about context-free-grammar

Related posts about homework