COURSE OUTCOMES
Upon the successful completion of the course, the student will be able to
Theory Components:
CO1: show proficiency in converting finite automata to regular expressions and vice versa. (CDL2)
CO2: exhibit the conversion of context free grammars into normal forms. (CDL2)
CO3: apply the relationship between pushdown automata and context free grammars. (CDL2)
CO4: design Turing machines for recognizing computable languages. (CDL2)
CO5: apply the concept of reduction to show the problem is undecidable. (CDL1)
- Teacher: THAMARAI SELVI D