PhD Studentship: Variations of Pattern Languages

Loughborough University

Start date of studentship: 1st October 2018

Closing date for applications: 16th February 2018


Primary supervisor: Dr Daniel Reidenbach

Area: Formal language theory; string algorithms; combinatorics on words

This fully funded PhD project deals with combinatorial and algorithmic properties of so-called pattern languages and their variations. The successful candidate will work within the Theoretical Computer Science research theme in the Department of Computer Science with internationally renowned experts in formal language theory. The position therefore provides an ideal stepping stone for applicants interested in an academic or research career.

Loughborough University is a top-ten rated university in England for research intensity (REF2014). In choosing Loughborough for your research, you’ll work alongside academics who are leaders in their field. You will benefit from comprehensive support and guidance from our Doctoral College, including tailored careers advice, to help you succeed in your research and future career.

Find out more:

Full Project Detail:

So-called patterns are a compact and natural way to describe certain structures in strings of symbols. While their definition is simple, it has been very hard to establish some of their properties, since these are often linked to deep combinatorial problems in Discrete Mathematics. Recent research on pattern languages has continued to make some progress on the basic model. In addition, variations of the original definition have been introduced to strengthen their expressive power and, hence, applicability, and some of these variants are linked to concepts widely used in data mining tasks. It is the purpose of this project to formally investigate the properties of these variations. This will typically involve establishing new insights into combinatorial properties of sequences of symbols, and it will aim to facilitate more efficient algorithms that find patterns in textual data. The emphasis of the project will be on rigorous mathematical study, but it is possible that it will also include the design, implementation and testing of algorithms.

Find out more:

Entry requirements:

Applicants should have, or expect to achieve, at least a strong 2:1 Honours degree (or equivalent) in Computer Science, Mathematics, or a related subject. A relevant Master’s degree and/or experience in one or more of the following will be an advantage: Theoretical Computer Science (especially Formal Language Theory), Discrete Mathematics (especially Combinatorics on Words), String Algorithms.

Funding information:

This studentship will be awarded on a competitive basis to applicants who have applied to this project and/or any of the advertised projects prioritised for funding by the School of Science.

The 3-year studentship provides a tax-free stipend of £14,553 (2017 rate) per annum (in line with the standard research council rates) for the duration of the studentship plus tuition fees at the UK/EU rate.  International (non-EU) students may apply however the total value of the studentship will be used towards the cost of the International tuition fee in the first instance.

Contact details:

Name: Dr Daniel Reidenbach

Email address:

Telephone number: +44-1509-222939

How to apply:

All applications should be made online at Under programme name Computer Science.

Please quote reference number: DR/CO/2018

Share this PhD
  Share by Email   Print this job   More sharing options
We value your feedback on the quality of our adverts. If you have a comment to make about the overall quality of this advert, or its categorisation then please send us your feedback
Advert information

Type / Role:



Midlands of England