Theory of Computation
This course introduces formal models of computation and the problems that they can solve. It presents Turing machines and equivalent models of computation. It also discusses the fundamental limitations of what can be computed. It covers finite state machines, regular expressions and regular grammars as well as context-free languages and grammars and non-context free grammars. It includes algorithms and decision procedures for regular and context-free languages, Turing machine, decidability and complexity analysis.
|Faculty||Faculty of Engineering and Built Environment|
|School||School of Electrical Engineering and Computing|
Not currently offered
On successful completion of this course, students will be able to:
|Assumed Knowledge||MATH1510 Discrete Mathematics, SENG6120 Data Structures|
* This assessment has a compulsory requirement.
|Contact Hours||Not currently offered|
|Timetable||2017 Course Timetables for COMP6270|