Course syllabus for Finite automata and formal languages

Course syllabus adopted 2022-01-27 by Head of Programme (or corresponding).

Overview

  • Swedish nameÄndliga automater och formella språk
  • CodeTMV029
  • Credits7.5 Credits
  • OwnerTKITE
  • Education cycleFirst-cycle
  • Main field of studyMathematics
  • DepartmentCOMPUTER SCIENCE AND ENGINEERING
  • GradingTH - Pass with distinction (5), Pass with credit (4), Pass (3), Fail

Course round 1

  • Teaching language English
  • Application code 52126
  • Open for exchange studentsYes

Credit distribution

0122 Written and oral assignments 3 c
Grading: UG		0 c0 c3 c0 c0 c0 c
0222 Examination 4.5 c
Grading: TH		0 c0 c4.5 c0 c0 c0 c

In programmes

Examiner

Eligibility

General entry requirements for bachelor's level (first cycle)
Applicants enrolled in a programme at Chalmers where the course is included in the study programme are exempted from fulfilling the requirements above.

Specific entry requirements

The same as for the programme that owns the course.
Applicants enrolled in a programme at Chalmers where the course is included in the study programme are exempted from fulfilling the requirements above.

Course specific prerequisites

Knowledge of discrete mathematics and programming.

Aim

The course's main topics are finite automata, regular expressions and context-free grammars. It also contains a short introduction to Turing machines.

Learning outcomes (after completion of the course the student should be able to)

Knowledge and understanding:

  • Define different concepts in automata theory and the theory of formal languages, such as (non-) deterministic automaton, regular expression, regular language, context-free grammar, context-free language, and Turing machine.
Competence and skills:
  • Prove properties of (some) languages, grammars and automata using rigorous mathematical methods.
  • Construct finite automata, regular expressions and context-free grammars accepting or generating certain languages.
  • Describe the language accepted by a finite automaton or generated by a regular expression or context-free grammar.
  • Convert descriptions of regular languages between the following formalisms: deterministic and non-deterministic finite automata as well as regular expressions.
  • Simplify automata and context-free grammars.
  • Determine if a word belongs to a certain (regular or context-free) language.
  • Construct Turing machines for simple tasks.
Judgement and approach:
  • Manipulate formal descriptions of (some) languages, grammars and automata.

Content

Finite automata and regular expressions are simple models of computation. They are for instance used to control traffic lights, to search for patterns, and for lexical analysis. Furthermore their theory can illustrate basic concepts in set theory and the theory of discrete structures.

Context-free grammars are used to parse and analyse both artificial languages (for instance programming languages) and natural languages.

Turing machines provide a more expressive model of computation. They help computer scientists understand the limits of mechanical computation by providing a precise definition of the concept of "algorithm".

More detailed contents: Proofs. Finite automata, regular expressions, and related algorithms. Context-free grammars. Properties of regular and context-free languages. A short introduction to Turing machines.

Organisation

Lectures, exercise sessions.

Literature

Course literature will be announced no later than 8 weeks prior to the start of the course.

Examination including compulsory elements

The course is examined by individual assignments and an individual written exam given in an examination hall.

The course examiner may assess individual students in other ways than what is stated above if there are special reasons for doing so, for example if a student has a decision from Chalmers on educational support due to disability.