In this paper we show that maximal rank automorphisms of free groups have a
solvable conjugacy problem by using combinatorial methods. Combined with t
he results from [4], this gives a normal form for such automorphisms. We al
so show that it is possible to algorithmically find the fixed subgroup of a
maximal rank automorphism.