COURSE OUTCOMES
1. Knowledge of finite automata, pushdown automata and Turing machines.
2. Knowledge of regular and context free languages.
3. Knowledge of Church’s Thesis & Unsolvability.
4. Knowledge of NP-Completeness.
Last Updated: 07/30/2015 08:06