Formal Languages and Models of Computation

The area of formal language and automata theory focuses on the investigation of abstract machines and is particularly interested in what problems these devices can solve and what resources they use. The importance of these formalisms is fundamental in theoretical computer science, as their utility has been found in many areas, including compiler construction, text manipulation, and formal verification. This is related to their capability of representing potentially infinite sets using finite representations. Their theoretical as well as practical importance motivates investigation into how to obtain optimised implementations. In this setting, it is important to keep their representations, algorithms, and resource usage as succinct and limited as possible, depending on the specific characteristics of the devices under consideration. This project will span from the study of these models and their computations to the investigation of the complexity of their algorithms, exploring techniques and tools from the area of formal language theory. The goal is to expand knowledge in this branch of theoretical computer science in order to improve understanding of different models of computation operating under resource restrictions, and to develop theories and techniques to study these devices. 94% of Loughborough’s research impact is rated world-leading or internationally excellent. REF 2021

The standard University IELTS English language requirement is 6.5 overall with 6.0 in each individual element (reading, writing, listening and speaking).

International students: £29,500

UK students: £5,238

UK/Home: £5,238

International: £29,500

October 2026

31 July 2026

• Loughborough, United Kingdom