Click to show Site menu [+]

Available in 2012

Callaghan CampusSemester 1

Previously offered in 2013, 2011, 2010, 2009, 2008, 2007, 2006

Introduces Formal Languages and their application to Safety-Critical Systems and Proofs of Correctness.
Discusses automata and their relationship to regular, context-free and phrase-structure languages. The computability theory is presented, including Turing machines, decidability and recursive functions.

Objectives
(1) To introduce students to the structure of automata and formal languages
(2) To give students understanding of the limitations on the capabilities of computers
(3) To give students an understanding of Formal Languages and their application to Safety-Critical Systems and Proofs of Correctness.
Content
(1) Formal Languages
(2) Safety-Critical Systems
(3) Proving Programs Correct.
(4) Finite automata and regular languages
(5) Push-down automata and context-free languages
(6) Turing machines and phrase-structured languages; Church-Turing Thesis
(7) Decidability
(8) Recursive functions
Replacing Course(s)
N/A
Transition
N/A
Industrial Experience
0
Assumed Knowledge
Good programming skills.
Knowledge of discrete mathematics.
Modes of Delivery
Internal Mode
Teaching Methods
Lecture
Tutorial
Assessment Items
Essays / Written Assignments
as per course outline
Examination: Formal
A final examination according to the university's examination timetable.
Contact Hours
Tutorial: for 2 hour(s) per Week for Full Term
Lecture: for 3 hour(s) per Week for Full Term

Timetables

2012 Course Timetables for COMP6270