
Weighted Tree Automata in the winter term 2010/11Course descriptionIn many areas of Computer Science trees are used to structure data and to represent hierarchical dependencies between parts of data; for instance, the structure of a sentence of a natural language is represented as a tree (parse tree). Hence, it is of general interest to provide algorithms and machines which decide whether trees have certain properties, rank trees by associating a weight with each of them, or transform trees into other trees. Taking up the natural language scenario, it is e.g. important to know the probability that a sentence is wellstructured with respect to some grammatical rules, or what the possible translations of a sentence of one language into another language are. Weighted tree automata are appropriate structures for such algorithms. In this lecture we will introduce their basic definitions and properties on a theoretical level, however keeping the application to natural language processing in mind. NewsThe first lecture is going to be on October 11, at 11.10 am, in room E005. ExercisesExercise sheets will be made available online approximately one week before the respective tutorial session. The exercises are to be prepared by the students and will be discussed in the tutorial. LiteratureSince the lecture covers concepts from algebra, formal language theory, tree automata theory, and machine translation, some of them being very recent, there is no single book which students might use to for their studies. Here is a list of books which might help in one area or the other. If not stated otherwise, they are available in the library (SLUB).
Books on other topics will be added to this list on demand. Schedule

Contact
Prof. Dr.Ing. habil. Dr. h.c./Univ. Szeged
Heiko Vogler Phone: +49 (0) 351 46338232 Fax: +49 (0) 351 46337959 email contact form 