**Seminar über ``Automatic monoids and groups''**

Based on the well-established theory of *finite automata* David Epstein
and his co-workers have developed the notion of *automatic groups*.
These are groups for which the operation of multiplication can be
realized by finite automata.
In particular, this means that these groups have easily decidable word
problems.
By now the theory of automatic groups is well developed.
Recently this notion has also been generalized to that of * automatic
semigroups* and *monoids*.
In this seminar we want to study some of the fundamental results for
automatic semigroups, monoids, and groups.