Course home page
Because of the coronavirus situation, all teaching on the course has moved to the Zoom remote meeting platform. For further information, see Forums -> Announcements.
Compulsory course of the Computer Science and Engineering major.
Responsible Professor: Pekka Orponen
Teaching Period: III - IV (Spring). The course starts on Tuesday 7 January 2020.
- Lectures: Tuesdays 10:15 - 12:00 T1 / C202 Tietotekniikka (Pekka Orponen)
- Tutorial sessions (starting Tue 7 Jan, 2020):
- Tuesdays 16:15 - 18:00 T6 / A136 Tietotekniikka (Etna Lindy)
Wednesdays 10:15 - 12:00 T6 / A136 Tietotekniikka (Mehdi Saman Booy)CANCELLED AS OF 12.2.
- Wednesdays 12:15 - 14:00 AS4 / 1023-1024 TUAS (Siiri Kuoppala)
- Thursdays 12:15 - 14:00 T6 / A136 Tietotekniikka (Siiri Kuoppala)
- Fridays 10:15 - 12:00 T5 / A133 Tietotekniikka (Etna Lindy)
- Fridays 12:15 - 14:00 T5 / A133 Tietotekniikka (Mehdi Saman Booy) NEW AS OF 14.2.
- Exceptionally in T6 / A136 on 28.2.
- Lectures: 24h (2h/week)
- Tutorial sessions in small groups: 24h (2h/week)
- Independent work: 82h
- Exam: 3h
- Total: 133h
After the course you know the most important mathematical models of computation and their characteristics. You can model
computation using finite automata and describe simple syntactic patterns with regular expressions and context-free grammars. You understand the possibilities and limitations of the computation models and description formalisms studied during the course, and know their relationships. You understand how
the Turing machine model characterises everything that can be computed with a computer program, and that there are well-defined problems that cannot be solved by any program.
Finite automata and regular languages. Context-free grammars and
pushdown automata. Turing machines and computability.
Assessment Methods and Criteria: Exam, tutorial problems and computerised assignments.
notes/slides and other separately
announced study material. Supporting textbook (recommended but not obligatory): Michael
Sipser, Introduction to the Theory of Computation, 2nd Ed. (2006)
Substitutes for Courses: ICS-C2000 Theoretical Computer Science, T-79.1001 Introduction to Theoretical Computer Science T (4 cr), T-79.1002 Introduction to Theoretical Computer Science Y (2 cr)
Prerequisites: CS-A1110 / CSE-A1110 Programming 1 and CS-A1120 / ICS-A1120 Programming 2 or CS-A1111 / CSE-A1111 Basic Course in Programming Y1 and CS-A1121 / CSE-A1121 Basic Course in Programming Y2, MS-A0401/A0402/A0409 Foundations of discrete mathematics.
Grading Scale: 0-5