计算理论20110331.pptVIP

* 计算理论导引 Introduction to the Theory of Computation 主讲：刘国华 （学院楼①225室，ghliu@） 助教：辛婷婷 （学院楼①153室，xtt.moon@163.com） FTP: CHAPTER 2 COMPUTATIONAL MODELS(5) THEORM 2.9 A language is context free if and only if some pushdown automaton recognizes it. LEMMA2.3 if a language is context free, then some pushdown automaton recognizes it. PROOF IDEA Let A be a CFL, and G= (V,?,R,S) be the CFG to generate A, for any string w?CFL, is there some PDA to accept w? Method:construction CHAPTER 2 COMPUTATIONAL MODELS(5) P=(Q,?,?,?,qstart,{qaccept}) Q={qstart,qloop,qaccept}?E ?=V?? The shorthand notation for ?: (r,u)??(q,a,s), where r,q?Q, a is the next input symbol, and s is symbol on the top of the stack,u=u1?ul, ui??,1?i? l. q r q1 a, s?z q2 a, s?xyz ?, ??y q q2 ?, ??z means CHAPTER 2 COMPUTATIONAL MODELS(5) ?: ?(qstart,?,? )={(qloop,S$)} ?(qloop,?,A)={(qloop,w)|where A?w is a rule in R} ?(qloop,a,a)={(qloop,?)} ?(qloop,?,$)={(qaccept,?)} qloop qaccept ?, ??S$ qstart ?, A?w for rule A?w a, a?? for terminal a ?, $? ? CHAPTER 2 COMPUTATIONAL MODELS(5) S?aTb|b T?Ta|? qaccept ?, ??S qstart b, b?? for terminal b ?, $? ? ?, ??$ qloop ?, S?b ?, S?aTb a, a?? for terminal a ?, T?? ?, T?Ta b, b?? for terminal b ?, $? ? ?, T?Ta ?, T?Ta b, aaaaaaab $ b b ? ? S ? T a a T a T CHAPTER 2 COMPUTATIONAL MODELS(5) THEORM 2.9 A language is context free if and only if some pushdown automaton recognizes it. LEMMA2.4 if a pushdown automaton recognizes some language, then it is context free . PROOF IDEA Method:construction Let P=(Q,?,?,?,qstart,{qaccept}) be a PDA, we will construct the CFG G= (V,?,R,S) to generate A recognized by P. CHAPTER 2 COMPUTATIONAL MODELS(5) P=(Q,?,?,?,q0,{qaccept}) G= (V,?,R,S) V={Apq|p,q?Q}, S=Aq0,qaccept R: 1)Apq?aArsb:for each p,q,r,s?Q, t??, and a,b?? ,if ?(p,a,? ) contains (r,t) and ?(s,b,t ) contains (q,?) ; (To find r,t by ?(p