| Area of Mathematics: | Computational and Applied Mathematics (ECAM) |
||
| Semester: | 5ο | ||
| Course ID: | 52404 | ||
| Course Type: | Elective | ||
| Teaching hours per week: | Theory: 3 | Practice: 0 | Laboratory: 0 |
| ECTS : | 5 | ||
| Eclass: | |||
| Instructors: | |||
Description
Finite automata and regular expressions. Pushdown automata and context-free grammars. Turing machines and Church’s thesis. Undecidability. Computational complexity.
Bibliography
- Sipser, ‘’Introduction to Theory of Computation’’, 2nd Edition Thomson Course Technology, 2006.
- H. R. Lewis & Ch. Papadimitriou, ‘’ Elements of Computation’’, 2nd Edition Prentice Hall, New Jersey, 1998
