COMP6363 Theory of Computation
COMP6363 is only available under certain award programs.
| Offered By | Research School of Computer Science |
|---|---|
| Academic Career | Graduate Coursework |
| Course Subject | Computer Science |
| Offered in | First Semester, 2011 and First Semester, 2012 |
| Unit Value | 6 units |
| Course Description |
This course covers the theoretical computer science areas of formal languages and automata, computability and complexity. Topics covered include: regular and context-free languages; finite automata and pushdown automata; Turing machines; Church's thesis; computability - halting problem, solvable and unsolvable problems; space and time complexity; classes P, NP and PSPACE; NP-Completeness. |
| Course Classification(s) | TransitionalTransitional courses are designed for students from a broad range of backgrounds and learning achievements, which provide for the acquisition of generic skills; or an informed understanding of contemporary issues; or fundamental knowledge for transition to Advanced or Specialist courses. |
| Areas of Interest | Computer Science |
| Requisite Statement |
Enrolment in the Master of Computing or Master of Computing Honours programs |
| Prescribed Texts |
Hopcropft, J.E., Motwani, R. & Ullman, J.D.Automata Theory, Languages, and Computation 3rd edition, Pearson Education, 2007. |
The information published on the Study at ANU 2011 website applies to the 2011 academic year only. All information provided on this website replaces the information contained in the Study at ANU 2010 website.
