FIT2014 - Theory of computation

Offered

Clayton Second semester 2007 (Day)
Malaysia Second semester 2007 (Day)

Synopsis

This unit looks at the question of exactly what a computer can compute, and gives an introduction to formal languages. Topics include computable functions, finite state automata, regular expressions, grammars, translators, and Turing computability.

Assessment

Compulsory assessed laboratory classes: 30%; Examination: 70%.

Contact hours

8 hours per fortnight

Prerequisites

FIT1002 or CSE1301 and 12 points (or 6 points completed and 6 points enrolled) from MAT1830, MAT1841, MTH1020, MTH1030, MTH1112, MTH2010.

Prohibitions

CSE2303, CSC2030