x !
Archived Curricula Guide 2010–2011
Curricula Guide is archieved. Please refer to current Curricula Guides
TKOPS104 Automata 6 ECTS
Organised by
Computer Science
Planned organizing times
Period(s) I II III IV
2011–2012 X
Preceding studies
Recommended:
Corresponding course units in the curriculum
Department of Computer Sciences
Curricula 2008 – 2010
TKOPS104 Automata 6 ECTS

Learning outcomes

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

Contents

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

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.

Further information

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

Belongs to following study modules

Department of Computer Sciences
1.1 Compulsory advanced courses in algorithmics (Computer Science)
Department of Computer Sciences
1.1 Compulsory advanced courses in information management (Computer Science)
2010–2011
Teaching
Archived Teaching Schedule. Please refer to current Teaching Shedule.
-
Department of Computer Sciences