Formal Languages and Automata
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.
|Faculty||Faculty of Engineering and Built Environment|
|School||School of Electrical Engineering and Computer Science|
Semester 1 - 2016
On successful completion of this course, students will be able to:
|Assumed Knowledge||Good programming skills. Knowledge of discrete mathematics.|
* This assessment has a compulsory requirement.
Face to Face On Campus 3 hour(s) per Week for Full Term
Face to Face On Campus 2 hour(s) per Week for Full Term
|Timetable||2016 Course Timetables for COMP6270|