The module introduces methods used to describe and reason about formal languages such as programming languages.
It presents a classification of formal languages Chomsky hierarchy and techniques for locating languages within it closure properties, pumping lemmas. Automata models corresponding to various levels of the Chomsky hierarchy are discussed along with the fundamental notion of computability.
These concepts are central to computer science. Organiser: Ramanujan Maadapuzhi Sridharan. Skip to main content Skip to navigation Note: This module is only available to students in the second year of their degree and is not available as an unusual option to students in other years of study.
- Account Options.
- The killer of little shepherds : a true crime story and the birth of forensic science.
- Modern China (A Brief Insight).
- Search form;
- A practical introduction to electronic circuits [...] XD-US!
Formal models of computation such as finite state automata, pushdown automata, and Turing machines. Formal definitions of languages, problems, and language classes including recursive, recursively enumerable, regular, and context free languages.
The relationships among various models of computation, language classes, and problems. Church's Thesis and the limits of computability. Proofs of program properties including correctness. Outgoing students should be able to define what a computation is and what a configuration within a computation is for arbitrary computational models.