• Offered by Research School of Computer Science
  • ANU College ANU College of Engineering and Computer Science
  • Course subject Computer Science
  • Areas of interest Computer Science
  • Academic career Undergraduate
  • Mode of delivery In Person
  • Co-taught Course COMP6363

This course covers the theoretical computer science areas of formallanguages 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.

 

Learning Outcomes

At successful completion of the course, students should:
  • Demonstrate advanced knowledge of formal computation and its relationship to languages
  • Distinguish different computing languages and classify their respective types
  • Recognise and comprehend formal reasoning about languages
  • Show a competent understanding of the basic concepts of complexity theory

Other Information

http://cs.anu.edu.au/courses/COMP3630/

Indicative Assessment

Assignments (30%); Final Exam (70%)

The ANU uses Turnitin to enhance student citation and referencing techniques, and to assess assignment submissions as a component of the University's approach to managing Academic Integrity. While the use of Turnitin is not mandatory, the ANU highly recommends Turnitin is used by both teaching staff and students. For additional information regarding Turnitin please visit the ANU Online website.

Workload

25h lectures, 12h tutorials, approx. 3×15h assignments, approx. 40h self-study, +exam prep.

Requisite and Incompatibility

To enrol in this course you must have completed (COMP1110 or COMP1140) and (COMP1600 or COMP2600). Incompatible with COMP6363.

Prescribed Texts

Hopcropft, J.E., Motwani, R. & Ullman, J.D.Automata Theory, Languages, and Computation 3rd edition, Pearson Education, 2007.

Indicative Reading List


M. Sipser (2012) Introduction to the Theory of Computation (alternative to [HMU06])
S. Aaronson (2005) NP-complete Problems and Physical Reality
S. Arora and B. Barak (2009) Computational Complexity: A Modern Approach

Majors

Specialisations

Fees

Tuition fees are for the academic year indicated at the top of the page.  

If you are a domestic graduate coursework or international student you will be required to pay tuition fees. Tuition fees are indexed annually. Further information for domestic and international students about tuition and other fees can be found at Fees.

Student Contribution Band:
Band 2
Unit value:
6 units

If you are an undergraduate student and have been offered a Commonwealth supported place, your fees are set by the Australian Government for each course. At ANU 1 EFTSL is 48 units (normally 8 x 6-unit courses). You can find your student contribution amount for each course at Fees.  Where there is a unit range displayed for this course, not all unit options below may be available.

Units EFTSL
6.00 0.12500
Note: Please note that fee information is for current year only.

Responsible Officer: Registrar, Student Administration / Page Contact: Website Administrator / Frequently Asked Questions