(https://www.coli.uni-saarland.de/~saurer/lehre/mg2/mg2-engl.html)
(Diese Seite gibt es auch auf Deutsch.)
The
course introduces the various types of languages and grammars (regular,
context-free, context-sensitive, type-0-grammars) on the one hand and presents
the corresponding types of abstract automata (finite automata,
push-down-automata, Turing-machines) on the other.
Special emphasis will be on the command of the various formalisms, from a
practical as well as theoretical perspective.
Mathematical
Foundations I. Students who haven't completed this course should consult with
the instructor first.
Partee, B., A. ter Meulen, R.Wall,
Mathematical Methods in Linguistics. Dordrecht: Kluwer 1990.
Lewis, H.R./C.H. Papadimitriou, Elements of the
Theory of Computation. New Jersey: Prentice Hall 1981.
Computational Linguistics
B.Sc. program: obligatory course. There will be a midterm and a final exam (45
min each).For details see German version. 8 credit points (Leistungspunkte)
Wed 16-18, building C 72,
seminar room; date of first meeting will be announced.
Course
mechanics and detailed lecture plan (in
German only)
Wed 14-15, Building C 72,
Room 1.06, Tel. 302-4177
E-mail Werner Saurer
Wed 14-15, Building C 72,
Room 1.11, Tel. 302-4496
E-mail Stefan Thater