T-79.1002 Introduction to Theoretical Computer Science Y (2 cr)

Autumn 2006

This short course introduces the basic tools for dealing with data streams consisting of sequences of discrete symbols: finite automata and regular languages, and context-free grammars and languages.

Starting in 2006/07, the course is lectured in the autumn semester only.

The course covers the first half of a more extensive course on models of computation, T-79.1001 Introduction to Theoretical Computer Science T (4 cr) . For topical information, please refer to the WWW info page of that course. This short version is mainly intended for students of other study programmes than computer science (T). Computer science students, and telecommunications students following a pre-2005 curriculum, are required to take the larger course. (The course corresponding to the old course code T-79.148 is the long version T-79.1001. You can not compensate course T-79.148 in your curriculum requirements by course T-79.1002.)

Note that the course includes compulsory computer assignments that need to be completed before participating in the examination. For details, see the registration information for the larger course.

[Current] [General] [Lectures] [Tutorials] [Exams] [Material] [Feedback] [Links]

Previous years: [Spring 2006] [Autumn 2005]

Current

• In 2006/2007 exams are scheduled for 30 Aug, 26 Oct, 21 Dec, 6 Mar, and 10 May. Registration via TOPI. All compulsory Regis assignments must have been completed before participating in the exam.
• First lecture Thu 14 Sep 2-4 p.m., Lecture Hall T1.
• Registration via TOPI opens 1 Sep at 09:00 and closes 28 Sep at 18:00. Registration is compulsory. Register using course code T-79.1001 even if you're really taking T-79.1002.

Material

• Previous exams of the T-79.1002 course
• Previous exams of the old T-79.148 course