TIETS03 Automata II 5 ECTS
Organised by
Degree Programme in Computer Sciences
Person in charge
Professor Erkki Mäkinen
Preceding studies
Compulsory:
TIETS02 Automata I
Corresponding course units in the curriculum
School of Information Sciences
Curricula 2015 – 2017
TIETS03 Automata II 5 ECTS

Learning outcomes

After completing the course the student is expected to
- understand the fundamental limitations of algorithmmic methods
- know the basics of computational complexity (especially NP-completeness)

Contents

The fundamental restrictions of algorithmic methods, solvability, deducibility, NP-completeness.

Teaching methods

Teaching method Contact Online
Lectures 26 h 0 h
Exercises 10 h 0 h

Teaching language

Finnish

Modes of study

Option 1
Available for:
  • Degree Programme Students
  • Other Students
  • Open University Students
  • Doctoral Students
  • Exchange Students
Participation in course work 
In Finnish
Further information 

Aktiivinen osallistuminen harjoituksiin ja kirjallinen kuulustelu.

Written exam and weekly exercises

Evaluation

Numeric 1-5.

Study materials

  1. Hopcroft, Motwani, Ullman, Introduction to Automata Theory, Languages, and Computation. Addison-Wesley 2001.

Belongs to following study modules

Faculty of Natural Sciences
Faculty of Natural Sciences
Faculty of Natural Sciences
Faculty of Natural Sciences
Faculty of Natural Sciences
Faculty of Natural Sciences
Faculty of Natural Sciences
2017–2018
Teaching
-
Faculty of Natural Sciences