Mathematics 424 | MAT 424 |
---|---|
Formal Languages, Automata and Computability | 3 (3-0-0-0-0) |
Formal grammars; normal forms; relationship between grammars and automata; regular expressions; finite state machines, state minimization; pushdown automata; Turing machines; computability; complexity; introduction to recursive function theory. Prerequisites: Mathematics 200 [C- minimum grade required] and (Mathematics (12) or Computing Science (9) or Information Technology (9) ) and 2nd year standing required or special conditions as specified below |