Mathematics Colloquium: A/Prof Laura Ciobanu
Linguists have always tried to understand the principles from which human speech and language take shape and develop. One of the most successful attempts is due to Chomsky, who, while investigating how and whether mathematically defined formal languages are capable of capturing key properties of human language, defined a hierarchy of formal languages and grammars that has proved valuable to mathematics, computer science and linguistics.
This talk will explain what constitutes the Chomsky hierarchy of formal languages and show some of its applications to mathematics and computer science.
About the speaker
A/Prof Laura Ciobanu (Heriot-Watt University, Scotland)
Laura works at the interface of pure mathematics (group theory, algebra) and theoretical computer science. She is an Associate Professor at Heriot-Watt University in Edinburgh, Scotland. Previously she held a Swiss National Science Foundation Professorship and Ambizione Fellowship at the University of Neuchâtel in Switzerland. She finished her PhD at Rutgers University, NJ, in January 2005, followed by postdocs in Barcelona at the CRM and University of Auckland, NZ. Laura is visiting UTS as a PI on the ARC Discovery Project "The language complexity of problems in algebra and logic" lead by Murray Elder.