FDD3372 Automata and Languages 6.0 credits

Automater och språk

Show course information based on the chosen semester and course offering:

Offering and execution

No offering selected

Select the semester and course offering above to get information from the correct course syllabus and course offering.

Course information

Content and learning outcomes

Course contents *

Finite automata, stack automata and Turing machines, and the important related language classes of regular and context free languages. The relation between automata and language is established by means of different transformations. The language classes are characterised by some classical theorems as Myhill-Nerode's theorem and Chomsky-Schützenberger's theorem.

Intended learning outcomes *

The general the aim of the course is to give the doctoral students a deep understanding of calculation and efficient computability through the abstract concept of automata and the languages that they know of. At the same time, the doctoral students will get familiar with the important concepts of state, non-determinism and minimization.

Course Disposition

No information inserted

Literature and preparations

Specific prerequisites *

Courses equivalent to SF1630 Discrete Mathematics and DD1350 Logic for Computer Science.

Recommended prerequisites

No information inserted


No information inserted


No information inserted

Examination and completion

If the course is discontinued, students may request to be examined during the following two academic years.

Grading scale *

P, F

Examination *

  • EXA1 - Examination, 6.0 credits, Grading scale: P, F

Based on recommendation from KTH’s coordinator for disabilities, the examiner will decide how to adapt an examination for students with documented disability.

The examiner may apply another examination format when re-examining individual students.

Other requirements for final grade *

Six home assignments, two laboratory assignments and a written examination.

Opportunity to complete the requirements via supplementary examination

No information inserted

Opportunity to raise an approved grade via renewed examination

No information inserted


Dilian Gurov

Ethical approach *

  • All members of a group are responsible for the group's work.
  • In any assessment, every student shall honestly disclose any help received and sources used.
  • In an oral assessment, every student shall be able to present and answer questions about the entire assignment and solution.

Further information

Course web

Further information about the course can be found on the Course web at the link below. Information on the Course web will later be moved to this site.

Course web FDD3372

Offered by

EECS/Theoretical Computer Science

Main field of study *

No information inserted

Education cycle *

Third cycle

Add-on studies

No information inserted

Postgraduate course

Postgraduate courses at EECS/Theoretical Computer Science