Automata Theory course content begins with an introduction to logic and formal grammar where learners will do a recap on sets, logic and truth tables. Formal language and grammar will then follow to enable learners differentiate regular and context free languages. An evaluation of the computability and complexity of practical computational problems which are the foundations of automata theory will then be done and the outcome will be problem description. 

Boolean algebra application in the design of finite state machines will be covered where learners are expected to gain an understanding of finite state machines, Turing Machines and Push Down automata. The Church’s thesis will culminate the study of various models of computation.