x !
Archived Curricula Guide 2011–2012
Curricula Guide is archieved. Please refer to current Curricula Guides
TKOPS134 Automata II 5 ECTS
Organised by
Computer Science
Preceding studies
Compulsory:
TKOPS104 Automata

Learning outcomes

To introduce further topics on the theory of formal languages and automata.

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

Evaluation

Numeric 1-5.

Recommended year of study

Advanced studies, 3rd year or later. The course is not lectured every year.

Study materials

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

Belongs to following study modules

School of Information Sciences
1.2 Optional advanced courses in computer science (Computer Science)
School of Information Sciences
Master level, Computer Science
2011–2012
Teaching
Archived Teaching Schedule. Please refer to current Teaching Shedule.
Period I Period II Period III Period IV
TKOPS134 Automaatit II
School of Information Sciences