703603 Formal Language and Automata Theory

winter semester 2013/2014 | Last update: 26.06.2013 Place course on memo list
703603
Formal Language and Automata Theory
VO 2
3
weekly
annually
English
Students who have completed this module should understand the topics covered in the lecture, and be able to express and apply them. They should be able to independently acquire similar knowledge and have a basic understanding of formal languages and the methods of automata theory.
Finite automata; regular expressions; context-free grammars; pushdown automata; Turing machines; undecidability.

Lecture, assessment is based on a single examination at the end of the course.

written exam

Dexter Kozen, Automata and Computability, Springer-Verlag, 1997, ISBN 0-387-94907-0

none

07.10.2013
Group 0
Date Time Location
Mon 2013-10-07
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2013-10-14
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2013-10-21
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2013-10-28
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2013-11-04
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2013-11-11
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2013-11-18
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2013-11-25
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2013-12-02
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2013-12-09
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2013-12-16
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2014-01-13
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2014-01-20
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2014-01-27
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2014-02-03
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free