This module introduces the theory of computation through a set of abstract machines that serve as models for computation. The topics that will be covered in this course include that of finite automata (DFA, NFA), regular expressions, minimization of DFA, equivalences of DFA and NFA, regular expressions, context free grammar, Push down automata, Chomsky normal form and Turing machine. The course also looks at the halting problem of TM, Turing-recognizable and Turing-acceptable languages.
Need to discuss? That's great! See me at my office (Parmanent Campus, Building C Room 315) or send me an email. I will get back to you as soon as possible!