山东大学-计算理论-非正则语言.pptVIP

? 2004 SDU Lecture5 Non-regular languages ? 2004 SDU * Are all languages regular? Answer: No! One argument: # of DFA’s on ?? # of languages on ?? ?the latter is larger than the former. ? 2004 SDU * Pumping Lemma First technique to show that specific given languages are not regular. The idea: Each regular language satisfies the pumping lemma, ?so, if a language does not, then, it is non-regular! ? 2004 SDU * Statement of Pumping Lemma If A is a regular language, then there is a number p (pumping length) where, if s is any string in A of length at least p, then s must be able to be divided into three pieces, s = xyz, satisfying the following conditions: 1. for each i ? 0, xyiz ? A, 2. |y| 0, and 3. |xy| ? p. ? 2004 SDU * Describing the pumping lemma (contd.) Take string with There is a walk with label: ......... s0 w1 s1 w2 sn-1 wn sn ? 2004 SDU * Describing the pumping lemma (contd.) If string has length , number of states, then, a state is repeated in the walk ...... ...... ? 2004 SDU * Describing the pumping lemma (contd.) Write w=xyz , here si is the first repeat state, and sl is the second apperance of si ...... ...... s0 s1 w1 w2 wi wi+1 si+1 sl-1 wl wl+1 si(sl) wn sn x=w1…wi y=wi+1…wl z=wl+1…wn ? 2004 SDU * Describing the pumping lemma (contd.) Observations : |xy| = |s0,…,si,si+1…,sl-1,si| - 1 ? (p+1)-1=p |y| = |si,…,sl-1,si|-1 ? 2-1=1 ...... s0 s1 w1 w2 wi wi+1 si+1 sl-1 wl si(sl) x=w1…wi y=wi+1…wl ? 2