|
MAT-41176 Theory of Automata, 5 cr |
Stephane Foldes
No implementations
Final exam plus activity points, particulars 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. | ||
4. | COURSE NOT GIVEN IN 2009-2010 |
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 | Mandatory/Advisable | Description |
MAT-21160 Algoritmimatematiikka | Mandatory |
Course | Corresponds course | Description |
|
|