703603 Formal Language and Automata Theory

winter semester 2012/2013 | Last update: 12.07.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.
written exam
Group 0
Date Time Location
Mon 2012-10-01
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2012-10-08
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2012-10-15
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2012-10-22
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2012-10-29
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2012-11-05
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2012-11-12
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2012-11-19
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2012-11-26
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2012-12-03
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2012-12-10
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2013-01-07
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2013-01-14
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2013-01-21
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Mon 2013-01-28
08.15 - 10.00 HS F (Technik) HS F (Technik) Barrier-free
Fri 2013-03-22
14.15 - 16.15 HS 10 HS 10 Barrier-free 2nd exam
Fri 2013-10-04
12.45 - 15.15 HS 10 HS 10 Barrier-free 3rd exam