School Of Computing, Engineering And MathematicsFormal Languages and AutomataWestern Sydney University Unit Code: 300121.2
Discipline: COMPUTER SCIENCE
Student Contribution Band: 2
Level: 3
Credit Points: 10
Prerequisite
200025 Discrete Mathematics
About this Unit
Three abstract models of computation are studied in this unit. The first is the finite automaton, together with regular languages and regular expressions. The second is the pushdown automaton, together with the associated languages and grammars. The third is the Turing machine. This allows study of the power of computers in general and their limitations, in particular situations: it is shown that there are problems for which there is no algorithmic solution. This unit explores the application of formal languages in the design of compilers and text processors.
Courses| 3633.2 | Bachelor of Computing | CONTINUING |
| 3639.1 | Bachelor of Information and Communications Technology | CONTINUING |
Specialisations