In recent years, more and more new applications of automata and
formal language theory have come to light in computer software
and other areas of computer science.
The new applications raise new questions in automata
and formal language theory, especially questions related
to efficient implementations of automata, regular expressions,
and grammars.
This course will focus on the topics of implementing automata
and formal language objects.
In the course, we will first review and study the basic theory
that is essential to many algorithms in this area.
Then we will study some most recent results published in
international workshops, conferences, and journals.
Future directions in this area of research are also discussed.
Participants of the course are expected to give presentations
of recent results in this area.
CS331 Foundations of Computer Science I or equivalent
Professor Sheng Yu, MC374, syu@csd.uwo.ca, Ext. 83715
Thursday 11:30-1:30
3:30-5:30 Wednesday, MC 316
No textbook is specified for the course.
The final mark is given according to the following factors:
Description
Prerequisites
CS340 Analysis of Algorithms or equivalent
Topics
Instructor
Office hours
Class meeting time and place
Textbook
References will be specified in class.
Assignments/exams/seminars
Evaluation