
Academic Year:  2019/0 
Owning Department/School:  Department of Computer Science 
Credits:  6 [equivalent to 12 CATS credits] 
Notional Study Hours:  120 
Level:  Masters UG & PG (FHEQ level 7) 
Period: 

Assessment Summary:  CW 70%, EX 30% 
Assessment Detail: 

Supplementary Assessment: 

Requisites:  Before or whilst taking this unit you must take CM50258 OR take CM50109 OR take another programming unit. 
Description:  Aims: To introduce formal models of computation: finite automata, pushdown automata, Turing machines, and the corresponding classes of formal languages: regular, contextfree, semidecidable. To teach students to design algorithms for concrete computational problems within these models of computation. To introduce the dichotomy between deterministic and nondeterministic computation. To give students an appreciation of limits of computation, including methods of proving undecidability and specific examples of undecidable problems. To introduce the concept of computational complexity and complexity classes. Learning Outcomes: On completion of this unit, students will be able to: 1. demonstrate an understanding of the fundamental models of computation and the corresponding classes of formal grammars and languages; 2. design algorithms for specific computational problems as automata of appropriate types; 3. demonstrate the practical application of grammars and language in to context of parsing algorithms 4. prove mathematically that some computational problems are undecidable within a particular class of computational models; 5. give upper bounds on complexities of some decidable computational problems. 6. put the theory in to practice by creating a parser for a specific language Skills: Use of IT (A), Application of Number (T/F, A), Problem Solving (T/F, A), Critical thinking (T/F,A), communication (T/F,A) Content: 1. Deterministic and nondeterministic finite automata. 2. Regular languages. Existence of nonregular languages. 3. Pushdown automata and contextfree grammars and languages. Parsing in contextfree languages. 4. Existence of noncontextfree languages via Pumping Lemma. 5. Turing machines and ChurchTuring Thesis. 6. Universal Turing machine and undecidability of the halting problem. 7. Nondeterministic Turing machines, complexity classes P and NP. 8. Parser implementation. 
Programme availability: 
CM50260 is Compulsory on the following programmes:Department of Computer Science

Notes:
