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.
FDD3372 Automata and Languages 6.0 credits
Content and learning outcomes
Course contents
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.
Recommended prerequisites
Equipment
Literature
Examination and completion
If the course is discontinued, students may request to be examined during the following two academic years.
Grading scale
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
Opportunity to raise an approved grade via renewed 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.