计算理论04PDA_NCF解读.pptVIP

今天课程 2.2 Pushdown Automata, ep101, cp66 Informal Description PDA (1) 与ep102， cp66 图稍有不同 Informal Description PDA (2) ep102 Formal Description PDA定义2.8 ep103形式化定义 cp67 PDA for L = { 0n1n | n?0 } ep104 cp67 例c3.9 PDA for L = { 0n1n | n?0 } ep104 cp67 例c3.9 0-—左括号，1—右括号 Machine Diagram for 0n1n ep103 cp67 例c3.9 Machine Diagram for 0n1n ep 103 PDAs versus CFL ep106 ，cp 69， 计划自学内容 2.3 Non-CF Languages ep115 cp74 先讲思想 “Pumping Lemma c3.19 for CFLs” ep115 与RL不同，CFL 两处打圈，至少一处是真圈， 先讲思想 Remember Parse Trees ep 116 cp75 ，先讲思想 Pumping a Parse Tree ep116 ，先讲思想 A Tree Tall Enough ep116 cp75，先讲思想 uvxyz ?L 派生树足够高，分段记号, ep116 cp75 uv2xy2z ?L , i=2 ep116 在上页基础上A再自己派生一次，先讲思想 uxz ? L, i=0, ep116 cp=75，先讲思想 Pumping Lemma for CFL 形式化的表述ThmC3.19 ep115, cp75 用 言多必复 概括 Formal Proof of Pumping Lemma ep116 cp75严格证明 求证 anbncn非CFL (Ex. c3.20) ep117 cp76 Pumping anbncn (Ex3.21 .) ep117 cp76 Example c3.21 (Pumping down) ep118 cp76 D = { ww | w?{0,1}* } (Ex. c3.22) ep119 cp77 Pumping Problems 技巧 Union Closure Properties 补充 Union Closure Properties 补充 Intersection Complement? 补充 计算理论 wbfeng@staff.shu.edu.cn Chapter 2: 2.2 (Pushdown automata) 2.3 Non-CF languages 2.3 CFL pumping lemma Closure properties of CFL Pushdown automata are for context-free languages what finite automata are for regularlanguages. PDA :描述CFL的设备 PDAs are recognizing automata that have a single stack (= memory): “硬件” 增加了栈 Last-In First-Out pushing and popping 对应于 可用 if ，goto, 读，和栈操作 的C程序 Difference: PDAs are inherently nondeterministic.(They are not practical machines.) 天生不确定 input w = 00100100111100101 内部状态集合 State set Q x y y z x stack The PDA M 读带 w and 且 作栈操作. Depending on - input wi ? ??,输入字母表 - stack sj ? ??,栈字母表 - state qk ? Q 状态集合the PDA M: - jumps to a new state, - pushes an element ??(nondeterministically) input w = 00100100111100101 internal state set Q x y y z x stack After the PDA has read complete input, M will be in state