Search course

Use the search function to find more information about the study programmes and courses available at Chalmers. When there is a course homepage, a house symbol is shown that leads to this page.

Graduate courses

Departments' graduate courses for PhD-students.

​​​​
​​

Syllabus for

Academic year
TMV025 - Finite automata theory and formal languages
 
Owner: TITEA
3,0 Credits (ECTS 4,5)
Grading: TH - Five, Four, Three, Not passed
Level: A
Department: 11 - MATHEMATICAL SCIENCES


Teaching language: Swedish

Course module   Credit distribution   Examination dates
Sp1 Sp2 Sp3 Sp4 No Sp
0102 Examination 3,0 c Grading: TH   3,0 c   18 Dec 2004 pm V,  02 Apr 2005 pm V,  22 Aug 2005 am V

In programs

TITEA INFORMATION ENGINEERING, Year 4 (elective)
TITEA INFORMATION ENGINEERING, Year 2 
TITEA INFORMATION ENGINEERING, Year 3 (elective)
TDATA COMPUTER SCIENCE AND ENGINEERING, Year 3 (elective)
TDATA COMPUTER SCIENCE AND ENGINEERING - Computer Languages, Year 4 (elective)

Examiner:

Bitr professor  Samuel Bengmark



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

Discrete mathematics similar to what could be expected of an IT student.

Aim

Finite automata theory is a fundamental computing science theory, it's also one of the earliest and simplest models of a computer. Apart from real applications (such as traffic lights, vending machines and lexical
analysis) the theory possesses great mathematical elegance. Finite automata theory is an ideal illustration of concepts within fundamental set theory and discrete structures and makes a natural step stone to e.g.
automata theory over infinite words and Turing machines.

Content

The exact contents of the course will be posted on the web page of the course.

Literature

Will be posted on the web page of the course at the start of the course.

Examination

Written exam.


Page manager Published: Thu 04 Feb 2021.