LFU:online

Advanced understanding of selected areas of specialisation in logic and learning; acquisition of the ability to independently educate themselves in the field. Students who have completed this course will have a thorough understanding of tree automata techniques as well as their use in applications.

A selection of the following topics will be covered:

• regular tree languages
• tree automata
• minimization
• closure properties
• decision problems
• regular grammars
• regular expressions
• regular relations
• weak monadic second-order logic
• tree automata completion
• first-order theory of rewriting
• automata with constraints
• tree set automata
• tree transducers

Continuous assessment based on regular written and oral contributions. An optional written test is offered at the end of the course.

Extensive slides. Accompanying literature will be linked from the course website.

None. Basic material about finite word automata will be recapitulated in the first lecture.

The course is taught in English.