MA41103: Formal Languages And Theory Of Computation

MA41103
Course name	Formal Languages And Theory Of Computation
Offered by	Mathematics
Credits	4
L-T-P	3-1-0
Previous Year Grade Distribution
{{{grades}}}
Semester	Autumn

Syllabus

Syllabus mentioned in ERP

Basic ideas of automata, transition systems, equivalence of NFA and DFA. Classification of languages, operations on languages, languages and automata. Regular expressions, pumping lemma for regular sets, application of pumping lemma, closure properties of regular sets, regular sets and regular grammars.

Context free languages context free Grammars, LR(k) Grammars, closure properties of languages, Turing machines, linear bounded automata, recursive functions, partial recursive functions and Turing machines.