Pushdown Automaton: CFL and the pumping lemma
Pushdown Automaton: CFL and the pumping lemma
Pushdown Automaton: CFL and the pumping lemma
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Intersection 2<br />
• <strong>CFL</strong> <strong>and</strong> RL are closed under intersection.<br />
Proof:<br />
Build a product automaton of a PDA <strong>and</strong> a DFA:<br />
Note that <strong>the</strong> resulting automaton is a PDA.<br />
input<br />
DFA<br />
PDA<br />
AND<br />
accept/reject<br />
stack<br />
52