Formal methods I
4 points
* Two 1-hour lectures and one 1-hour tutorial per week
* First semester
* Clayton
* Prerequisites: CSC1011 and 12 points
of approved first-year mathematics subjects (or equivalent)
Objectives On completion of the subject students should be able to analyse functions and, where appropriate, show why they are computable; analyse languages and, where appropriate, associate them with automata and grammars; and represent knowledge using predicate logic and make logical deductions based on that knowledge.
Synopsis This subject looks at the question of exactly what a computer can compute, and gives an introduction to logic and formal languages. Topics include computable functions, finite state automata, regular expressions, grammars, Turing computability, propositional logic, resolution, predicate logic.
Assessment Examination (2 hours): 100%
* Satisfactory performance on
tutorial work is a requirement
Prescribed texts
Lewis H R and Papadimitriou C H Elements of the theory of computation Prentice-Hall, 1981
| Published by Monash University, Clayton, Victoria
3168 Copyright © Monash University 1996 - All Rights Reserved - Caution Authorised by the Academic Registrar December 1996 |