Formal Languages and Automata Theory

Study of regular languages, regular expressions, and finite state machines, deterministic and non-deterministic finite state machines, pushdown automata, context-free grammar, Turing machines, and applications of various kinds of finite state machines.

Hours: XYZ where X = Lecture, Y = Lab, Z = Credit
All hours are per week.
3 Lab hours constitute 1 credit hour
1 credit hour implies 1 lecture of 50mins per academic week. 16 weeks in total.
Pre-Requisite courses are courses required to be completed before this course may be taken
Co-Requisite courses are courses required to be taken along with this course