Request Information

Please complete the form below, and an admissions advisor will contact you shortly.


Apply Now

Ready to take the next step?

The application process is easy. We accept and review applications year-round, and qualified applicants can begin classes any month of the year, depending on your program and location.

Click Apply Now to get started on the next exciting chapter of your life!

Apply Now

CSC610 Mathematical Foundations

Lead Faculty: Dr Pradip Peter Dey

Course Description

A study of mathematical models of computation and theoretical foundations of computer science. Proof techniques, automata theory, Chomsky hierarchy, decidability and computational complexity are emphasized.

Learning Outcomes

  • Construct a model of computation for a given specification.
  • Develop a program implementing the model of computation.
  • Prove that regular expressions are equivalent to Finite State Machines.
  • Prove that complement of a regular language is regular.
  • Prove that a given language is Context-Free.
  • Construct a Push Down Automaton for a given computational problem.
  • Construct a Turing Machine for a given computational problem.