703025 Formal Language and Automata Theory

summer semester 2009 | Last update: 10.07.2009 Place course on memo list
703025
Formal Language and Automata Theory
VO 3
4,5
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
not applicable
Group 0
Date Time Location
Thu 2009-03-05
08.15 - 11.00 HS F (Technik) HS F (Technik) Barrier-free
Thu 2009-03-12
08.15 - 11.00 HS F (Technik) HS F (Technik) Barrier-free
Thu 2009-03-19
08.15 - 11.00 HS F (Technik) HS F (Technik) Barrier-free
Thu 2009-03-26
08.15 - 11.00 HS F (Technik) HS F (Technik) Barrier-free
Thu 2009-04-02
08.15 - 11.00 HS F (Technik) HS F (Technik) Barrier-free
Thu 2009-04-23
08.15 - 11.00 HS F (Technik) HS F (Technik) Barrier-free
Thu 2009-04-30
08.15 - 11.00 HS F (Technik) HS F (Technik) Barrier-free
Thu 2009-05-07
08.15 - 11.00 HS F (Technik) HS F (Technik) Barrier-free
Thu 2009-05-14
08.15 - 11.00 HS F (Technik) HS F (Technik) Barrier-free
Wed 2009-05-20
16.15 - 19.00 HS F (Technik) HS F (Technik) Barrier-free
Thu 2009-05-28
08.15 - 11.00 HS F (Technik) HS F (Technik) Barrier-free
Thu 2009-06-18
08.15 - 11.00 HS F (Technik) HS F (Technik) Barrier-free
Thu 2009-06-25
08.15 - 11.00 HS F (Technik) HS F (Technik) Barrier-free
Thu 2009-07-09
08.00 - 11.00 HS A (Technik) HS A (Technik) Barrier-free 1.Klausur