T-79.148 Introduction to Theoretical Computer Science (2 cr)

Spring 2003

This introductory course on the theory of computation covers
the basic aspects of finite automata and regular languages,
context-free grammars and pushdown automata, Turing machines
and computability theory.

The spring installation of the course is primarily oriented
towards T students. However also students from other degree
programmes (e.g. S) are welcome to participate at their own risk,
i.e. considering that the selection of topics and the expected
background may at times be somewhat T-specific.

The course exam is on Wednesday 7 May, 9--12 a.m.
Remember to register for the exam via
TOPI,
and note that all your
Regis assignments
must be completed by the exam date --- otherwise your exam paper
will not be graded (really!). Please fill in and return also the
computerised course
feedback form.
(English form here.)
If you submit the form by 11 May, you earn
an extra exam point that counts towards increasing your grade
in case you pass the course. The feedback is processed
anonymously, i.e. the computerised feedback system removes
the student id's from the forms and provides them as a separate
list only for credit assignment purposes.

Registration by
TOPI.
You must register both for
the lectures and for a tutorial group. (Your
registration is needed for bookkeeping purposes,
even if you were not intending to attend.)
One of the tutorial groups (indicated below)
will be given in English and the rest in Finnish.
Registration for the tutorials opens
Monday 13 January at 9:00 and closes
Friday 31 January at 18:00.

In order to pass the course you have to:

complete three compulsory sets of home assignments, and

get a passing grade on the exam, as augmented by
credit earned from the tutorials.

The compulsory assignments are individually computer-generated
for each student, and are submitted over the network.
Completing these assignments is a
mandatory prerequisite
for participating in the exam.
For more details, see the computerised assignments
info page.

In the tutorials, there will be three home assignments and
two or three demonstration problems each week. The tutorials
are not compulsory, but bonus exam points (max 6) will be awarded
for doing the home assignments and marking them as done at the
tutorial sessions. The grading scheme for the tutorials is as follows:

Problems solved

Bonus points

5

1

10

2

15

3

20

4

25

5

30

6

In addition to the voluntary tutorials there are
three compulsory computer-generated problem sets.
(See the info page.)

The tutorial bonus points awarded expire in
one year, i.e. they are valid
up to but not including the corresponding course exam in
the following year (approx. May 2004).
The demonstration problems are likely to be at least 90% the same
as in the Autumn 2002 installation of the course.
The Autumn 2002 problem sets and their solutions are
bundled together with the lecture notes, and can be ordered from
Edita. The demonstration problems are discussed at the
tutorials to the extent that time permits.
Updates to the demonstration problems and their solutions
are distributed via this site.

Tutorial problems: Electronic copies downloadable here
on the Tuesday of each week. Paper copies available at the
lectures, and from the rack outside the theory lab office
(TB336).

Material

Textbook(s):
The recommended English textbook for the course is
M. Sipser, Introduction to the Theory of Computation
(PWS Publishing 1997).
The former recommended
text, H. Lewis and C. Papadimitriou,
Elements of the Theory of Computation
(Prentice Hall 1998) is being phased out.
Finnish students do not need to purchase the textbook,
since the course follows closely the lecture notes.
However the Sipser book is very reader-friendly
yet insightful, so reading it on the side will help
in following the course.

Supporting material:

Demonstration problems and their solutions from the tutorials.
Material from Autumn 2003 bundled together with the
lecture notes; updates available as the course progresses.

Some of the material will be available also via this web page.
Please avoid unnecessary printing of this material
to save printers, paper and thus nature !!!

A short introduction to set theory and relations
(by Tommi Syrjänen, in Finnish, ps/
pdf).