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
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 .

how to write program Minimum Cost Calculation - Vogel Approximation Method(VAM

We now add an additional degree of non-determinism and allow transitions that can be taken independent of the input-ε-transitions. Here whenever the automaton is in state 1

Suppose A = (Σ, T) is an SL 2 automaton. Sketch an algorithm for recognizing L(A) by, in essence, implementing the automaton. Your algorithm should work with the particular automa

Kleene called this the Synthesis theorem because his (and your) proof gives an effective procedure for synthesizing an automaton that recognizes the language denoted by any given r

How useful is production function in production planning?

Our primary concern is to obtain a clear characterization of which languages are recognizable by strictly local automata and which aren't. The view of SL2 automata as generators le

What is the purpose of GDTR?

We will specify a computation of one of these automata by specifying the pair of the symbols that are in the window and the remainder of the string to the right of the window at ea

As we are primarily concerned with questions of what is and what is not computable relative to some particular model of computation, we will usually base our explorations of langua