Wednesday, 10 August 2016

Theory of Computation Unit 3 (Pushdown Automata and Context Free Languages)

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.

No comments:

Post a Comment