School Of Computing, Engineering And Mathematics

Formal Languages and AutomataWestern Sydney University Unit Code: 300121.2


Student Contribution Band: 2

Level: 3

Credit Points: 10

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.

3633.2Bachelor of ComputingCONTINUING
3639.1Bachelor of Information and Communications TechnologyCONTINUING


M3000.1Computer SystemsCONTINUING
SM3004.1Formal SystemsCONTINUING

Western Sydney University Copyright © 2004-2016 ABN 53 014 069 881 CRICOS Provider No: 00917K Contact Us | Disclaimer | Emergency Help |