Skip to main content
Till KTH:s startsida

FDD3372 Automata and Languages 6.0 credits

Information per course offering

Course offerings are missing for current or upcoming semesters.

Course syllabus as PDF

Please note: all information from the Course syllabus is available on this page in an accessible format.

Course syllabus FDD3372 (Spring 2019–)
Headings with content from the Course syllabus FDD3372 (Spring 2019–) are denoted with an asterisk ( )

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.

Literature and preparations

Specific prerequisites

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

Literature

You can find information about course literature either in the course memo for the course offering or in the course room in Canvas.

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.

Examiner

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 room in Canvas

Registered students find further information about the implementation of the course in the course room in Canvas. A link to the course room can be found under the tab Studies in the Personal menu at the start of the course.

Offered by

Main field of study

This course does not belong to any Main field of study.

Education cycle

Third cycle

Postgraduate course

Postgraduate courses at EECS/Theoretical Computer Science