Course info
COURSE OUTCOMES
Upon Completion of this course, the students will be able to
CO1: prove the equivalence of regular expressions and finite automata. (K3)
CO2: acquire insights into the relationship among context free languages and context free grammars (K3)
CO3: construct and prove the equivalence of languages described by pushdown automata and context free grammars. (K3)
CO4: realize the concepts of turing machines and its construction methods. (K3)
CO5: recognize the concepts of undecidability and complexity theory. (K2)
Upon Completion of this course, the students will be able to
CO1: prove the equivalence of regular expressions and finite automata. (K3)
CO2: acquire insights into the relationship among context free languages and context free grammars (K3)
CO3: construct and prove the equivalence of languages described by pushdown automata and context free grammars. (K3)
CO4: realize the concepts of turing machines and its construction methods. (K3)
CO5: recognize the concepts of undecidability and complexity theory. (K2)
- Teacher: THAMARAI SELVI D
- Teacher: DR MOHAIDEEN PITCHAI K
- Teacher: DHEENATHAYALAN S