Theory of Computation (3160704)

Unit-1:  Review of Mathematical Theory

Unit-2:  Regular Languages and Finite Automata

Unit-3:  Context free grammar (CFG)

Unit-4:  Pushdown Automata, CFL And NCFL

Unit-5:  Turing Machine (TM)

Unit-6:  Computable Functions

Unit-7:  Undecidability

After learning the course the students should be able to:

• Use the concepts and techniques of discrete mathematics for theoretical computer science.
• Identify different formal languages and their relationship.
• Classify and construct grammars for different languages and vice-versa.
• Build finite automata, push down automata and turing machine.
• Analyze various concepts of undecidability and Computable Function and Discuss analytically and intuitively for problem-solving situation.