Total Credits: 10
Level: Level 2
Target Students: Part I undergraduate students in the School of Computer Science only.This module is part of the Foundations of Computer Science theme in the School of Computer Science.
Availability: Module is dormant in 17/18 academic year.
|Spring||Assessed by end of Spring Semester|
Prerequisites: G51FUN Introduction to Functional Programming (2104-15) G51PRG Introduction to Programming (up to 2014-15) G51MFC Mathematical Foundations of Computer Science (2014-15)
Summary of Content: You’ll investigate classes of formal language and the practical uses of this theory, applying this to a series of abstract machines. You’ll focus in particular on language recognition, but will study a range of topics including: finite state machines; regular expressions; context-free grammars; and Turing machines. You’ll spend around two hours per week in lectures studying for this module.
Module Web Links:
Method and Frequency of Class:
|Activity||Number Of Weeks||Number of sessions||Duration of a session|
|Lecture||10 weeks||2 per week||1 hour|
Method of Assessment:
|Exam 1||75||2 hr written examination|
|Coursework 1||25||Problem sheets with theoretical and small programming problems|
Dr H Nilsson
Education Aims: To make the students conversant with central concepts of formal language and automata theory, such as finite automata and context-free grammars, and their applications. To give an introduction to computability theory.
Learning Outcomes: Knowledge and Understanding: Understanding of the equivalence between machine types and language types; the nature of formal languages and their specification by grammars and other notations; the practical and theoretical relevance of machines that process strings from an alphabet of symbols as models of computation; and the fundamental limits on what is computable by any machine.Intellectual Skills: Apply and deploy mathematical ability, practices and tools; understand complex ideas and relate them to specific problems or questions. Professional Skills: Understanding and ability to apply techniques for language specification. Transferable Skills: The ability to use mathematics to solve problems.
Offering School: Computer Science
Use the Back facility of your browser to return to the previous page.
Search for another module
Return to The University of Nottingham Welcome Page