6 points, SCA Band 2, 0.125 EFTSL
Undergraduate - Unit
Refer to the specific census and withdrawal dates for the semester(s) in which this unit is offered.
Students who have not done one of the programming units specified are encouraged to consult the Chief Examiner regarding possible approval to enrol in this unit.
This unit introduces formal languages, models of computation, and computational complexity. It looks at what computers can and cannot compute. Topics include finite state automata, regular expressions, grammars, pushdown automata, computable functions, Turing machines, polynomial-time reductions, complexity classes P and NP, and NP-completeness. Skills at writing formal proofs will be developed.
At the completion of this unit, students should be able to:
- use propositional logic, predicates and quantifiers to represent and analyse problems in the theory of computation;
- construct Finite Automata, Nondeterministic Finite Automata, Context-Free Grammars, and Turing Machines to describe languages;
- convert Regular Expressions into Finite Automata and vice versa;
- find a Regular Grammar for a Regular Language;
- find a parse tree, leftmost derivation and rightmost derivation for a word in a Context Free Language;
- use Turing Machines to represent computable functions;
- demonstrate the limitations of the models of computation considered;
- show a language is not regular, or not context-free, or not decidable;
- show that a language is in P, or in NP, or NP-complete;
- write rigorous formal proofs, including proofs by construction, cases, contradiction and induction.
Examination (3 hours): 60%; In-semester assessment: 40%
Minimum total expected workload equals 12 hours per week comprising:
- Contact hours for on-campus students:
- Two 1-hour lectures
- One 2-hour tutorial
- Additional requirements (all students):
- A minimum of 8 hours of independent study per week for reading, working on exercises and assignment(s).
See also Unit timetable information