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
TKOPS104 Automata

Learning outcomes

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


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


Modes of study


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
School of Information Sciences
Archived Teaching Schedule. Please refer to current Teaching Shedule.
School of Information Sciences