Finite automata and formal languages

Utbildningsfakta

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

Behörighet

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 DIT984, MMG200 or equivalent) - 7\.5 credits in programming (for example DIT441, DIT143, DIT013, DIT948, DIT953, MVG200 or equivalent) Applicants must prove knowledge of English: English 6/English level 2 or the equivalent level of an internationally recognized test, for example TOEFL, IELTS.

Utbildningstillfällen

Varje tillfälle har egna datum och villkor. Avslutade tillfällen behålls som historik och innebär inte att en ny ansökan är öppen.

• Finite automata and formal languages

  University of Gothenburg

  GÖTEBORG

  Startdatum: 18 januari 2027

  Slutdatum: 21 mars 2027

  Studietakt: 50 %