Please note! Course description is confirmed for two academic years, which means that in general, e.g. Learning outcomes, assessment methods and key content stays unchanged. However, via course syllabus, it is possible to specify or change the course execution in each realization of the course, such as how the contact sessions are organized, assessment methods weighted or materials used.

LEARNING OUTCOMES

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.

Credits: 5

Schedule: 11.01.2022 - 11.04.2022

Teacher in charge (valid for whole curriculum period):

Teacher in charge (applies in this implementation): Pekka Orponen

Contact information for the course (applies in this implementation):

CEFR level (valid for whole curriculum period):

Language of instruction and studies (applies in this implementation):

Teaching language: English. Languages of study attainment: English

CONTENT, ASSESSMENT AND WORKLOAD

Content
  • valid for whole curriculum period:

    Finite automata and regular languages. Context-free grammars and pushdown automata. Turing machines and computability.

Assessment Methods and Criteria
  • valid for whole curriculum period:

    Exam, tutorial problems and computerised assignments.

Workload
  • valid for whole curriculum period:

    Lectures, teaching in small groups, independent work and exam.

DETAILS

Study Material
  • valid for whole curriculum period:

    Lecture notes/slides and other separately announced study material. Supporting textbook (recommended but not obligatory): Michael Sipser, Introduction to the Theory of Computation.

Substitutes for Courses
Prerequisites
SDG: Sustainable Development Goals

    9 Industry, Innovation and Infrastructure

FURTHER INFORMATION

Further Information
  • valid for whole curriculum period:

    Teaching Period:

    2020-2021 Spring III-IV

    2021-2022 Spring III-IV

    Course Homepage: https://mycourses.aalto.fi/course/search.php?search=CS-C2160

    Registration for Courses: Kurssille ilmoittaudutaan WebOodissa. Katso ilmoittautumisaika WebOodista. Ilmoittautumiseen