MonMap
A course mapper by Monash Association of Coding (MAC)
Theory of computation
FIT2014
Synopsis
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.
Sourced from the Monash Handbook 2026.
Quick facts
- Credit points
- 6
- Level
- 2
- Audience
- Undergraduate
- Type
- Coursework
- School
- Faculty of Information Technology
- Handbook year
- 2026
Prerequisites (13)
- Symbolic logicATS2866
- Fundamentals of algorithmsFIT1008
- Fundamentals of algorithms (Advanced)FIT1054
- Foundations of computingFIT1058
- Fundamentals of algorithms for engineersFIT2085
- Discrete mathematics for computer scienceMAT1830
- Techniques for modelling (Advanced)MTH1035
- Linear algebra with applicationsMTH2021
- Linear algebra (Advanced)MTH2025
- Real analysisMTH2140
- Algebra 1: Group theoryMTH2141
- Real analysisMTH3140
- Algebra 1: Group theoryMTH3141
What it unlocks (4)
- Privacy enhancing technologiesFIT3185
- Number theory and cryptographyMTH2137
- Network mathematicsMTH3170
- Network mathematics (Advanced)MTH3175
Offerings (4)
- Second semesterMalaysia · ON-CAMPUS / Clayton · FLEXIBLE
- First semesterMalaysia · ON-CAMPUS / Clayton · FLEXIBLE
Listed in 7 areas of study
- Computational scienceLevel 2 and 3 computational science
- Computational scienceLevel 2 and 3 computational science
- Computer scienceAdditional Computer science unit
- MathematicsMathematics elective units
- MathematicsMathematics elective units
- Pure mathematicsPure mathematics elective units
- Pure mathematicsPure mathematics elective units