Finite automata and formal languages - University of Gothenburg Till startsida
To content Read more about how we use cookies on

Finite automata and formal languages

Bachelor's level | 7.5 credits | Course code: DIT322

The course is not given as a stand-alone course this academic year, but can be included in the program/course package. For information contact the department.

About the Course

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

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.

More Information

Show more

Course Syllabus


Tuition Fee

Please contact the department.
EU/EEA citizens, Swedish residence permit holders and exchange students do not pay fees. More information on:

Study Guidance



Department of Computer Science and Engineering
41296 Göteborg

Visiting address: Rännvägen 6 B

Page Manager: Jörgen Ölund
Last update: 2/18/2020 2:41 PM

Tell a friend about this page
Print version

Page Manager: Jörgen Ölund|Last update: 10/16/2018

The University of Gothenburg uses cookies to provide you with the best possible user experience. By continuing on this website, you approve of our use of cookies.  What are cookies?