Abstract
M.Sc.
In this thesis we study some of the propertie of a clas called automatic structures. Automatic structures are structures that can be encoded (in some defined way) into a set
of regular languages. This encoding allows one to prove many interesting properties about
automatic structures, including decidabilty results.