This course introduces Deterministic and nondeterminisitic finite automata, regular expressions, context-free grammars, pushdown automata, context-sensitive grammars, parsing of LR(O) and LR(K) languages, Turing machines and computability.
Course
CSCI3130 – Formal Languages and Automata Theory
MIEG Elective Undergraduate
Co-requisite(s):
Unit(s):
3
Pre-requisite(s):
CSCI2110 or ENGG2440 or ESTR2004
Exclusion:
Term Offered:
T1
Teacher:
Remarks: