TIETS02 Automata I 5 ECTS
Organised by
Degree Programme in Computer Sciences
Preceding studies
Recommended:
Corresponding course units in the curriculum
School of Information Sciences
Curricula 2015 – 2017
TIETS02 Automata I 5 ECTS

Learning outcomes

After completing the course the student is expected to know the basics of automata and formal language theory.

Contents

Finite automata. Basics of formal language theory. The Chomsky hierarchy of formal languages. Context-free languages. Pushdown automata. Turing machines.

Teaching methods

Teaching method Contact Online
Lectures 28 h 0 h
Exercises 12 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 viikkoharjoituksiin 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