| TDDD65 |
Introduction to the Theory of Computation, 6 ECTS credits.
/Introduction to the Theory of Computation/
For:
CS
|
OBS! |
The course is not available for exchange students
|
| |
Prel. scheduled
hours: 54
Rec. self-study hours: 106
|
| |
Area of Education: Science
Main field of studies: Computer Science, Computer Engineering
|
| |
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.
and demonstrate knowledge concerning
- the basic rules and regulations for advanced studies and how to apply the ethical code of academia in their own studies,
- the requirements of reports and exams in their education.
|
|
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 present the theory and seminars are devoted to problem solving.
The course runs over the entire autumn semester.
|
|
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.
The course also includes university rules, ethical rules, academic writing and reporting and how to prepare for examination.
|
|
Course literature:
Michael Sipser Introduction to the Theory of Computation (2nd edition), Thomson 2006
Additional reading: Thomas A. Sudkamp, Languages and Machines (3d edition), Pearson Education 2006
|
|
Examination: |
|
Written examination
Assignments - academic studies
Assignments - computation
|
3 ECTS
2 ECTS
1 ECTS
|
| |
|
|
Course language is English.
Department offering the course: IDA.
Director of Studies: Ahmed Rezine
Examiner: Christer Bäckström
Link to the course homepage at the department
Course Syllabus in Swedish
|