1. Lecture # 30 Theory Of Automata By Dr. MM Alam 1
  2. Lecture# 29 Recap • PDA = CFG • PDA to CFG conversion Examples 2
  3. • At every stage we have the following equivalence: Working string = (letters cancelled from TAPE) (string of nonterminals from STACK • At the beginning this means: working string = S letters cancelled = none string of nonterminals in STACK = ∆ 3
  4. • At the end this means: working string = the whole word letters cancelled = all STACK= ∆ 4
  5. PDA Examples in JFLAP • How to simulate PDA in JFLAP • Deterministic PDA Example • Non Deterministic PDA Example 5
  6. PDA Example • All Push, Pop and Tape read symbols in one diagram. • How to run Deterministic PDA in JFLAP • How to run Non Deterministic PDA Example in JFLAP 6
  7. Even Palindrome 7
  8. Palindrome with X 8
  9. • Chomsky Normal Form in JFLAP Repeat
  10. Lecture 30 Summary • PDA to CFG formulas • Chomsky Normal Form in JFLAP Repeat • PDA Example in JFLAP • Even Palindrome Example in JFLAP 10