After successful completion of the course, students are able to define the language families wihin the Chomsky hierarchy, to give examples from these language families and to solve given examples. In the area of logic, students are able to find models and counter-examples for given predicate logic formulas as well as to define the basics of the Hilbert and tableau calculus and to solve simple examples in these calculi.
Specification of of formal languages: regular and context free languages (deepening), Chomsky hierarchy, finite automata (deepening), push-down auomata, Turing machines; elements of complexity theory; syntax-semantic interface, model structures, terms and boolean expressions; selected topics of classical propositional and first order logic, Hilbert and tableau calculus.
Presentation of the main topics and of typical examples.
Exercise sheet for each of the two parts, theoretical computer science and logic, respectively.
Final written exam.
Bitte melden Sie sich hier an, um Zugriff auf den TUWEL-Kurs zu erhalten.
The student has to be enrolled for at least one of the studies listed below
