Pushdown Automata: Definition of PDA, Deterministic Pushdown Automata, PDA corresponding to given CFG, CFG corresponding to a given PDA.
Context Free Languages: The pumping lemma for CFL’s, Closure properties of CFL’s, Decision problems involving CFL’s.

Subscribe to:
Post Comments (Atom)

## No comments:

## Post a Comment