Formal Languages and Automata Theory
| Hours: 3 0 3 |
|---|
Study of Regular languages, regular expressions and finite state machines, deterministic & non-deterministic finite state machines, pushdown automata, context free grammar, Turing Machines and applications of all kinds of finite state machines
Pre-requisites: CS231
| Co-requisites: none |
|---|
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
