Current students

Finn Lidbetter, Master’s candidate
David R. Cheriton School of Computer Science

Let x and y be words. We consider the languages whose words z are those for which the numbers of occurrences of x and y, as subwords of z, are the same (resp., the number of x's is less than the number of y's, resp., is less than or equal). In this talk we will give a necessary and sufficient condition on x and y for these languages to be regular, and we show how to check this condition efficiently. 

Matthew Amy, PhD candidate
David R. Cheriton School of Computer Science

Adam Molnar, Deakin University

Ellen Arteca, Master’s candidate
David R. Cheriton School of Computer Science

Alexi Turcotte, Master’s candidate
David R. Cheriton School of Computer Science

Abdullah Rashwan, PhD candidate
David R. Cheriton School of Computer Science

Md Faizul Bari, PhD candidate
David R. Cheriton School of Computer Science

Aiman Erbad, Computer Science and Engineering Department
Qatar University