CSE2303

Formal methods I (6 points)

(IT)

Leader:

Offered:
Clayton First semester 2003 (Day)
Malaysia First semester 2003 (Day)
Clayton First semester 2004 (Day)
Malaysia First semester 2004 (Day)

Synopsis: Introduction to formal languages and logic. Topics include regular expressions, finite automata, nondeterministic finite automata, Moore machines, Mealy machines, grammars, pushdown automata, Turing machines, propositional logic, predicate logic, and resolution.

Assessment: Examination (3 hours): 70% + Laboratory work: 30%

Contact Hours: Two 1-hour lectures per week and one 1-hour tutorial and one 2-hour laboratory per fortnight

Prerequisites: CSE1301 or CSC1011 and either 12 points of approved first-year mathemtics units (or equivalent), or 6 points of approved first-year mathematics units (or equivalent) as a prerequisite and 6 points of approved first-year mathematics units (or equivalent) as a corequisite.

Prohibitions: CSC2030