CE349 : THeory of compUTATION

CO-1 : Apply basic concepts of theory of computation in the computer field in order to solve computational problems. 

CO-2 : Construct algorithms for different problems and argue formally about correctness on different restricted machine models of computation. 

CO-3 : Analyse and design finite automata, pushdown automata and Turing machine for formal languages.

CO-4 : Apply rigorously formal mathematical methods to prove properties of languages, grammars and automata. 

CO-5 : Identify limitations of some computational models and possible solutions. 

CO-6 : Design context free grammars for formal languages.