pushdownautomata.docVIP

Pushdown Automata Read K S 3.3. Read Supplementary Materials: Context-Free Languages and Pushdown Automata: Designing Pushdown Automata. Do Homework 13. Recognizing Context-Free Languages Two notions of recognition: (1) Say yes or no, just like with FSMs (2) Say yes or no, AND if yes, describe the structure a + b * c Just Recognizing We need a device similar to an FSM except that it needs more power. The insight: Precisely what it needs is a stack, which gives it an unlimited amount of memory with a restricted structure. ( ( ( ( ( ) ) ) ) ( ) ( ( ) ) ( Finite ( State ( Controller ( ( ( Definition of a Pushdown Automaton M = (K, (, (, (, s, F), where: K is a finite set of states ( is the input alphabet ( is the stack alphabet s ( K is the initial state F ( K is the set of final states, and ( is the transition relation. It is a finite subset of (K ( (( ( {(}) ( (* ) ( ( K ( (* ) state input or ( string of symbols to pop state string of symbols to from top of stack push on top of stack M accepts a string w iff (s, w, () |-M* (p, (, () for some state p ( F A PDA for Balanced Brackets [//[ s ]/[/ M = (K, (, (, (, s, F), where: K = {s} the states ( = {[, ]} the input alphabet ( = {[} the stack alphabet F = {s} ( contains: ((s, [, (), (s, [ )) ((s, ], [ ), (s, ()) Important: This does not mean that the stack is empty. An Example of Accepting [//