Courses / Module

Toggle Print

Module THEORY OF COMPUTATION

Module code: CS355
Credits: 5
Semester: 2
Department: COMPUTER SCIENCE
International: Yes
Overview Overview
 

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.

Open Learning Outcomes
 
Open Teaching & Learning methods
 
Open Assessment
 
Open Repeat options
 
Open Pre-Requisites
 
Open Timetable
 
Back to top Powered by MDAL Framework © 2019
V5.2.0 - Powered by MDAL Framework © 2019