|
|
|||||||||||||||||
Course Catalog 2010-2011
MAT-41176 Theory of Automata, 5 cr |
Person responsible
Stephane Foldes
Requirements
Final exam plus classroom activity, particulars to be announced during first lecture.
Principles and baselines related to teaching and learning
-
Content
| 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 |
Study material
| 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 |
Prerequisite relations (Requires logging in to POP)
Correspondence of content
| Course | Corresponds course | Description |
|
|
|
Additional information
In 2010-2011: periods 1-2
Suitable for postgraduate studies