4CS4-06: Theory Of Computation

Curricula details

Course Objectives (COs)

  1. To create the foundations of Finite automata and regular expressions, and its relation to practical computer science.
  2. To induce the concepts of pushdown automata, conext free languages, and gramamrs, and establish its relation to HLL, and NLs
  3. To understand the theory of how computations can take place, difficulty levels of computation.
  4. To understand the TM as a general problem solving machines, and its capabilities.
  5. To understand the complexity theory and its applications.
  6. To understand the undecidability and undecidable problems.