Finite automata and formal languages

Education facts

Code: DIT323

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".

Entry requirements

To be eligible for this course, students must have successfully completed 45 credits in computer science or mathematics, including the following courses: 7\.5 credits in discrete mathematics (for example DIT980, MMG200 or equivalent) 7\.5 credits in programming (for example DIT440, DIT143, DIT012, DIT948, DIT953, MVG200 or equivalent)

Education offerings

Each offering has its own dates and conditions. Closed offerings are retained as history and do not mean that a new application is open.

• Finite automata and formal languages

  University of Gothenburg

  Start date: 20 January 2025

  End date: 23 March 2025

  Pace of study: 50 %