Biography
Owen graduated with first-class honours from his undergraduate master's degree in Computer Science from Â鶹ֱ²¥ University in 2022, and won the MSci Finalist Prize for the highest overall mark.
He is now studying for a PhD in theoretical computer science, with particular focus on database theory and combinatorics on words.
He also holds a teaching assistant position for several undergraduate modules: Logic for Computer Science, Mathematics for Computer Science, Formal Languages and Theory of Computation, Formal Methods, and Cloud Computing.
Research
A member of the String and Word Equation Lab Â鶹ֱ²¥ (SWELL), Owen researches the algorithmic and combinatorial properties of string-based logics. His primary focus is on the logic FC which has a one-to-one correspondence to the framework of document spanners. In modern life, textual data is ubiquitous, from books and reports to social media and log files, and Owen's research has practical applications in the extraction of relevant information from this data, particularly in improving the efficiency of such data requests.
His current work is on efficient models that maintain powerful features such as recursion and the backreference operator commonly implemented by regex engines. Previously, he has worked on the learnability of similar models.
.