Skip to content

Latest commit

 

History

History
73 lines (69 loc) · 2.96 KB

Readme.md

File metadata and controls

73 lines (69 loc) · 2.96 KB

afs

This repository contains my teaching materials for "Automaten & Formale Sprachen" (automata & formal languages) in German. I used them to teach students in tutorials on this subject. There are two sets of slides:

  • First version of slides from 2010
  • Second, revised version of slides from 2012

2012

The slides cover the following topics:

  1. AFS 0
  • Revision of discrete mathematics
  1. AFS I
  • Languages
  • Definitions
  • Finite automata
  • Regular expressions
  1. AFS II
  • Equivalence of automata
  • Powerset construction
  • Chomsky hierarchy
  • Pumping lemma for regular languages
  • Minimisation of finite automata
  1. AFS G
  • Grammars
  • Chomsky hierarchy
  • Chomsky normal form
  1. AFS III
  • Closure properties
  • Pumping lemma examples
  1. AFS IV
  • Ambiguity of grammars
  • Pushdown automata
  • Pumping lemma for context-free languages
  1. AFS PL
  • Pumping lemma for regular and context-free languages
  • Examples of proofs using the pumping lemma
  1. AFS V
  • Turing machines
  • Cardinality of classes of languages
  1. KOMP
  • Introduction to complexity theory

2010

The slides cover the following topics:

  1. AFS 0
  • Revision of discrete mathematics
  1. AFS 1
  • Languages
  • Definitions
  • Finite automata
  • Regular expressions
  1. AFS 2
  • Equivalence of automata
  • Powerset construction
  • Chomsky hierarchy
  • Pumping lemma for regular languages
  • Minimisation of finite automata
  1. AFS G
  • Grammars
  • Chomsky hierarchy
  • Chomsky normal form
  1. AFS 3
  • Closure properties
  • Pumping lemma examples
  1. AFS 4
  • Ambiguity of grammars
  • Pushdown automata
  • Pumping lemma for context-free languages
  1. AFS 5
  • Turing machines
  • Cardinality of classes of languages
  1. KOMP
  • Introduction to complexity theory