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

The Last Stop Boutique is having a five-day sale. Each day, starting on Monday, the price will drop 10% of the previous day’s price. For example, if the original price of a product

Let ? ={0,1} design a Turing machine that accepts L={0^m 1^m 2^m } show using Id that a string from the language is accepted & if not rejected .

write grammer to produce all mathematical expressions in c.

matlab v matlab

1. Does above all''s properties can be used to prove a language regular? 2..which of the properties can be used to prove a language regular and which of these not? 3..Identify one

A Turing machine is a theoretical computing machine made-up by Alan Turing (1937) to serve as an idealized model for mathematical calculation. A Turing machine having of a line of

To see this, note that if there are any cycles in the Myhill graph of A then L(A) will be infinite, since any such cycle can be repeated arbitrarily many times. Conversely, if the


Differentiate between DFA and NFA. Convert the following Regular Expression into DFA. (0+1)*(01*+10*)*(0+1)*. Also write a regular grammar for this DFA.