Search programme

​Use the search function to search amongst programmes at Chalmers. The programme overview and the programme syllabus relating to your studies are generally from the academic year you began your studies.

​​​

Syllabus for

Academic year
TMV026 - Finite automata theory and formal languages
 
Owner: TKITE
5,0 Credits (ECTS 7,5)
Grading: TH - Five, Four, Three, Not passed
Level: A
Department: 37 - COMPUTER SCIENCE AND ENGINEERING


Teaching language: English

Course module   Credit distribution   Examination dates
Sp1 Sp2 Sp3 Sp4 No Sp
0105 Examination 5,0 c Grading: TH   5,0 c   31 May 2007 am M,  27 Aug 2007 am M

In programs

TKITE SOFTWARE ENGINEERING, Year 2 
TDATA COMPUTER SCIENCE AND ENGINEERING - Computer Languages, Year 4 (elective)
TITEA SOFTWARE ENGINEERING, Year 3 (elective)
DCMAS MSc PROGR IN DEPENDABLE COMPUTER SYSTEMS, Year 1 (elective)

Examiner:

Professor  Thierry Coquand


Replaces

TMV025   Finite automata theory and formal languages


Eligibility:

For single subject courses within Chalmers programmes the same eligibility requirements apply, as to the programme(s) that the course is part of.

Course specific prerequisites

Knowledge in mathematics, including a course in Discrete mathematics, and in programming.

Aim

This course presents both the theory finite automata and of pushdown automata.

Finite automata (and regular languages) are one of the first and simplest model of computations. Its mathematical theory is quite elegant and simple, and finite automata are widely used in applications (traffic light, lexical analysis, pattern search algorithm, etc...).

Finite automata constitute also a perfect illustration of basic concepts in set theory and discrete structure.

Pushdown automata are finite automata with stacks. The theory is more complex, but has important applications in parsing and analysis of context-free languages which is also a fundamental concept in computer science.

Examination


Page manager Published: Thu 03 Nov 2022.