In this paper we study structures defined by finite
automata, called automatic structures. We provide
a method that reduces the study of automatic structures
to the study of automatic graphs. We investigate isomorphism
invariants of automatic structures with an emphasis to
equivalence relation structures, linearly
ordered sets, and permutation structures.