Finite Automata Theory and Formal Languages

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

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

Finite automata and regular languages are one of the first and simplest models of computation, and their mathematical theory is quite elegant and simple. Finite automata are widely used to model certain physical systems (traffic light, vending machines, ...) or to describe some applications (lexical analysis, pattern search algorithm, ...). 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. Turing machines were described by Alan Turing in 1937 and they are a powerful model of computation since they help computer scientists understand the limits of mechanical computation by providing a precise definition of an 'algorithm' or 'mechanical procedure'.

More Information

http://gul.gu.se/public/cour...

Course Syllabus

DIT321

Tuition Fee

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