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

Learning outcomes

The goal of the course is to introduce the basics of automata and formal languages and their typical applications in computer science.


Finite automata. Other types of automata. Basics of formal language theory. The Chomsky hierarchy of formal languages. Context-free languages. Applications.

Teaching methods

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

Further information

The course topics have previously included in the course Introduction to Theory of Computation.

Belongs to following study modules

School of Information Sciences
School of Information Sciences
School of Information Sciences
Archived Teaching Schedule. Please refer to current Teaching Shedule.
School of Information Sciences