Transcription of Pushdown Automata (()PDA)
{{id}} {{{paragraph}}}
Pushdown Automata (PDA)()Reading: Chapter 61 PDA - the Automata for CFLs What is? FA to Reg LangPDA is to CFL FA to Reg Lang, PDA is to CFL PDA == [ -NFA + a stack ]Wht k? Why a stack? -NFAI nputstringAccept/reject2A stack filled with stack symbols Pushdown Automata -Definition A PDA P := ( Q, , , ,q0,Z0,F ): Q: states of the -NFA : input alphabet :stack symbols :transition function q0:start stateZInitial stack top s mbol Z0:Initial stack top symbol F:Final/accepting states3old stateStack top input state(s)new Stack top(s) : Q x x =>Q x : The Transition Function (q,a,X) = {(p,Y).}
string Accept/reject 2 A stack filled with “stack symbols” ... matching symbols Q = {q 0, 1, 2 q 0 q 1 q 2
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}