CEUC302 : THeory of compUTATION

CO1: Design regular grammar, regular expression, finite automata and apply them to practical text processing tasks such as lexical analysis and pattern matching.

CO2: Design context free grammar and push-down automata and apply them to model nested language structure and parsing in programming and natural languages.

CO3: Design Turing Machine for the formal language problems and demonstrate their role in general purpose text transformation tasks.

CO4: Model and analyze formal languages using automata and grammars, and relate them to realworld applications such as compilers, interpreters and natural language processing.

CO5: Identify weather a given computational / text processing problem is decidable or undecidable and classify it in terms of complexity classes.

CO6: Apply automata theory concepts to the design of system software components such as lexical analyzers, parsers, and text editors.

CO7: Evaluate computational problems arising in text and language processing and justify solutions using formal models and complexity theory.