THEORY OF COMPUTATION
- Module code: CS355
- Credits: 5
- Semester: 2
- Department: COMPUTER SCIENCE
Mathematical preliminaries; regular languages, finite automata, and regular expressions; nondeterminism and determinism in finite automata; finite automata minimisation; properties of regular languages; nonregular languages; context-free languages, context-free grammars, and pushdown automata; nondeterminism and determinism in pushdown automata; properties of context-free languages; non-context-free languages; multi-stack machines; Turing machines and Church Turing thesis; decidable and recognisable languages; undecidability of languages.
On successful completion of the module, students should be able to:
|Teaching & Learning methods|
Timetable under review
The Lectures timetable allows you to search by most courses that are offered by the University.
The Venues timetable allows you to search the timetable by venue.
The Departments timetable allows you to search the timetable by department.
The Students timetable is a personalised timetable. The student is required to login using their Student ID and Password.