|
|
|||||||||||||||||
MAT-41176 Theory of Automata, 5 cr |
Stephane Foldes
| Lecture times and places | Target group recommended to | |
| Implementation 1 |
|
Final exam plus activity points, particularly to be announced during first lecture.
-
| Content | Core content | Complementary knowledge | Specialist knowledge |
| 1. | Strings of symbols, languages and mathematical machines. | ||
| 2. | Deterministic and non-deterministic computations. Turing machines, algorithms, decidability. | ||
| 3. | Oracles and reducibility. Complexity of computation. |
| Type | Name | Author | ISBN | URL | Edition, availability, ... | Examination material | Language |
| Book | Introduction to the Theory of Computation | Sipser, M. | PWS Publ. Co., Boston 1996 | English |
| Course | O/R |
| MAT-21160 Algoritmimatematiikka | Obligatory |
| Course | Corresponds course | Description |
|
|
|
| Description | Methods of instruction | Implementation | |
| Implementation 1 |