Formal Languages and Automata
|Course code COMP2270||Units 10||Level 2000||Faculty of Engineering and Built EnvironmentSchool of Electrical Engineering and Computer Science|
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.
Available in 2014
|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
(8) Recursive functions
|Assumed Knowledge||SENG1120, MATH1510|
|Modes of Delivery||Internal Mode|
|Contact Hours||Lecture: for 3 hour(s) per Week for Full Term|
Tutorial: for 2 hour(s) per Week for Full Term
|Timetables||2014 Course Timetables for COMP2270|