Regular expressions and finite automata.
Context-free grammars and push-down automata.
Regular and contex-free languages, pumping lemma.
Turing machines and undecidability.
- B. Tech. CSE (IIT Delhi) ‘96
- M. S. (Research), CSE(IIT Delhi) ‘98
- Ph.D. (National University of Singapore), 2001
- Outstanding Teacher Award from IIT Roorkee
- IBM International Faculty Award
"I think this is Sir's best course ever - definitely check it out."
- Parth Tehran, M.Tech IIIT B