Applying the pumping lemma, Theory of Computation

Applying the pumping lemma is not fundamentally di?erent than applying (general) su?x substitution closure or the non-counting property. The pumping lemma is a little more complicated-rather than just the single universal quanti?er ("for all languages L") and single existential quanti?er ("there exists n"), we have a nest of alternating quanti?ers (denoting "for all" as ∀ and "there exists" as ∃):

(∀L)[L regular ⇒

(∃n)[

(∀x)[x ∈ L and |x| ≥ n ⇒

(∃u, v,w)[x = uvw and

|uv| ≤ n and

|v| ≥ 1 and

(∀i ≥ 0)[uviw ∈ L]]]]].

Just as with the lemmas for the local languages, we will approach this as an adversary game. Our proof will consist of a strategy for showing that L fails to satisfy the pumping lemma. Our choices are the "for all"s; the "there exists"s are our adversary's choices. There are just a few more rounds in this game than there were in the lemmas for the local languages. The key things are being clear about which are our choices and which are the adversary's and making sure that our strategy accounts for every legal choice the adversary
might make.

The game starts with our choice of the L we wish to prove to be non regular. Our adversary then chooses some n, we choose a string x ∈ L of length at least n, etc. We win if, at the end of this process, we can choose i such that uviw ∈ L. Of course, our strategy at each step will depend on the choices our adversary has made.

What we end up with is a proof by contradiction. For instance:

To show that Lab = {ajbj| j ≥ 0} is not regular.

Posted Date: 3/21/2013 1:45:12 AM | Location : United States







Related Discussions:- Applying the pumping lemma, Assignment Help, Ask Question on Applying the pumping lemma, Get Answer, Expert's Help, Applying the pumping lemma Discussions

Write discussion on Applying the pumping lemma
Your posts are moderated
Related Questions
Sketch an algorithm for the universal recognition problem for SL 2 . This takes an automaton and a string and returns TRUE if the string is accepted by the automaton, FALSE otherwi

Another striking aspect of LTk transition graphs is that they are generally extremely ine?cient. All we really care about is whether a path through the graph leads to an accepting

design a tuning machine for penidrome

constract context free g ={ a^n b^m : m,n >=0 and n

The universe of strings is a very useful medium for the representation of information as long as there exists a function that provides the interpretation for the information carrie

. On July 1, 2010, Harris Co. issued 6,000 bonds at $1,000 each. The bonds paid interest semiannually at 5%. The bonds had a term of 20 years. At the time of issuance, the market r

Normal forms are important because they give us a 'standard' way of rewriting and allow us to compare two apparently different grammars G1  and G2. The two grammars can be shown to

If the first three words are the boys down,what are the last three words??

Our DFAs are required to have exactly one edge incident from each state for each input symbol so there is a unique next state for every current state and input symbol. Thus, the ne

distinguish between histogram and historigram