Monash home | About Monash | Faculties | Campuses | Contact Monash |
Staff directory | A-Z index | Site map |
(IT)
|
Leader: Ann Nicholson
Offered:
Not offered in 2006.
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: Two x 2 hr lecture/week, One x 1 hr tutorial/week or One x 3 hr laboratory/week
Prerequisites: FIT1002, CSE1301, MAT1841, MAT1830
Prohibitions: CSE2303, CSC2030