CSC701: Automata Theory and Formal Language / College of Computing, Informatics and Mathematics

The goal of this course is to study abstract computing devices or “machines”. Finite automata is a simpler kinds of machines used to model hardware and software and used extensively in compiler design and construction. The studies of formal “grammars” is incorporated because of the close relationships to abstract automata especially as a basis of software components including parts of compilers. Towards the end, students will be introduced to the Turing Machine, a simple model of a computer and discuss about the kind of languages abstract computers can accept.