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
If the first three words are the boys down,what are the last three words??

What are the benefits of using work breakdown structure, Project Management

Proof (sketch): Suppose L 1 and L 2 are recognizable. Then there are DFAs A 1 = (Q,Σ, T 1 , q 0 , F 1 ) and A 2 = (P,Σ, T 2 , p 0 , F 2 ) such that L 1 = L(A 1 ) and L 2 = L(

Generate 100 random numbers with the exponential distribution lambda=5.0.What is the probability that the largest of them is less than 1.0?

The computation of an SL 2 automaton A = ( Σ, T) on a string w is the maximal sequence of IDs in which each sequential pair of IDs is related by |- A and which starts with the in

For example, the question of whether a given regular language is positive (does not include the empty string) is algorithmically decidable. "Positiveness Problem". Note that

What is the purpose of GDTR?


This close relationship between the SL2 languages and the recognizable languages lets us use some of what we know about SL 2 to discover properties of the recognizable languages.