| TDDC95 | Introduction to the Theory of Computation, 4 ECTS credits. /Introduction to the Theory of Computation/ |
|||
Prel. scheduled
hours: |
||||
|
Area of Education: Science Subject area: Computer Science |
||||
| Advancement level
(G1, G2, A): G2
|
||||
| Aim: During this course the students will learn concepts and techniques of formal languages, automata, computability and complexity, relevant for the engineering practice. They are applied, among others, in systems modeling and verification and in compiler construction. They also allow to reason if a computational problem at hand can be solved at all and if it has an efficient solution. After this course, a student will be able to use techniques of: - formal language definition by accepting automata and by formal grammars, - transformation of such definitions, - analysis of decidability of algorithmic problems - complexity analysis. |
||||
| Prerequisites: (valid for students admitted to programmes within which the course is offered) Basic course in discrete mathematics. Basic course in algorithms and data structures. Note: Admission requirements for non-programme students usually also include admission requirements for the programme and threshhold requirements for progression within the programme, or corresponding. |
||||
| Supplementary courses: Compiler construction |
||||
| Organisation: Lectures (24 hours) and seminars devoted to problem solving (8 hours). |
||||
| Course contents: Finite automata and regular languages. Push-down automata and Context-free languages. Turing Machines and Church-Turing Thesis. The notion of decidability; important undecidable problems. Techniques for checking undecidability. Big-Oh-notation, techniques for analysis of algorithms. Time complexity classes P, NP. NP-completeness and its practical relevance. Basics of space complexity. |
||||
| Course literature: Course book (prel.): Michael Sipser Introduction to the Theory of Computation (2nd edition), Thomson 2006 or Ganesh Gopalakrishnan Computation Engineering: Applied Automata Theory and Logic, Springer 2006 |
||||
| Examination: | ||||
| Written examination Obligatory homework assignments |
2 p 0,5 p |
/ / |
3 ECTS 1 ECTS |
|
Course language is English. Department offering the course: IDA. Director of Studies: Erik Larsson Examiner: Jan Maluszynski Course Syllabus in Swedish |
||||
|
|
 |
|||||
| ||||||