703603 Formal Language and Automata Theory
winter semester 2014/2015 | Last update: 15.10.2014 | Place course on memo list703603
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
06.10.2014
- Faculty of Mathematics, Computer Science and Physics
Group 0
|
||||
---|---|---|---|---|
Date | Time | Location | ||
Mon 2014-10-06
|
08.15 - 10.00 | HS F (Technik) HS F (Technik) | Barrier-free | |
Mon 2014-10-13
|
08.15 - 10.00 | HS F (Technik) HS F (Technik) | Barrier-free | |
Mon 2014-10-20
|
08.15 - 10.00 | HS F (Technik) HS F (Technik) | Barrier-free | |
Mon 2014-10-27
|
08.15 - 10.00 | HS F (Technik) HS F (Technik) | Barrier-free | |
Mon 2014-11-03
|
08.15 - 10.00 | HS F (Technik) HS F (Technik) | Barrier-free | |
Mon 2014-11-10
|
08.15 - 10.00 | HS F (Technik) HS F (Technik) | Barrier-free | |
Mon 2014-11-17
|
08.15 - 10.00 | HS F (Technik) HS F (Technik) | Barrier-free | |
Mon 2014-11-24
|
08.15 - 10.00 | HS F (Technik) HS F (Technik) | Barrier-free | |
Mon 2014-12-01
|
08.15 - 10.00 | HS F (Technik) HS F (Technik) | Barrier-free | |
Mon 2014-12-15
|
08.15 - 10.00 | HS F (Technik) HS F (Technik) | Barrier-free | |
Mon 2015-01-12
|
08.15 - 10.00 | HS F (Technik) HS F (Technik) | Barrier-free | |
Mon 2015-01-19
|
08.15 - 10.00 | HS F (Technik) HS F (Technik) | Barrier-free | |
Mon 2015-01-26
|
08.15 - 10.00 | HS F (Technik) HS F (Technik) | Barrier-free | |
Mon 2015-02-02
|
08.15 - 10.00 | HS F (Technik) HS F (Technik) | Barrier-free |