After successful completion of the course, students are able to deal with logical calculations of the resolution system and other forms of automatic proof; regular and context-free languages; finite automata and turing machines as well as with aspects of the complexity theory.
Exercises on the lecture's subject matter
For further information please consult the TUWEL-page of the corresponding lecture.
Students present solutions of given exercises.
Not necessary
