Study Guide@lith   Link to LiU Homepage
 

Linköping Institute of Technology

Link to LiU Homepage
 
Valid for year : 2011
 
TDDC95 Introduction to the Theory of Computation, 4 ECTS credits.
/Introduction to the Theory of Computation/

For:   CS  

 

Prel. scheduled hours:
Rec. self-study hours: 107

  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.


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.

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:
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
Homework assignments
3 ECTS
1 ECTS
 



Course language is English.
Department offering the course: IDA.
Director of Studies: Patrick Lambrix
Examiner: Gustav Nordh
Link to the course homepage at the department


Course Syllabus in Swedish

Linköping Institute of Technology

Link to top of pagep


Contact: TFK , val@tfk.liu.se
Last updated: 04/26/2011