| TDDA89 | Formal Languages and Automata Theory, 5 ECTS credits. /Formella språk och automatateori/ |
||
|
Area of Education: Subject area: |
|||
| Advancement level
(A-D): B
|
|||
| Aim: The purpose of the course is to give an introduction to formal languages and automata theory. |
|||
| Prerequisites: (valid for students admitted to programmes within which the course is offered) TATM 43 Discrete mathematics, basic course, or TATM 90 Discrete Mathematics and Logic or TDDB 90 Discrete Mathematics and Logic 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: TDDB44 Compiler Construction |
|||
| Organisation: The theory is presented during the lectures. Problem solving is practiced during the lessons. |
|||
| Course contents: Course content: Finite automata and regular expressions. Context-free grammars and pushdown automata. Deterministic context-free grammars, LR parsing.Chomsky's hierarchy. Introduction to Turing Machines and undecidability. |
|||
| Course literature: It will be announced later |
|||
| Examination: | |||
| Written examination Hand-in assignments |
3,5 p 0 p |
||
Course language is English. Department offering the course: IDA. Director of Studies: Examiner: Link to the course homepage at the department Course Syllabus in Swedish |
|||
|
|
 |
|||||
| ||||||