Classes of Minimal Words of Small Lengths in a Finitely Generated Free Group

Let F_n denote the free group of finite rank n. A word w\in F_n is called minimal if no type 2 Whitehead automorphism can reduce its length. We explore the Whitehead algorithm in classifying minimal words of small lengths in F_n up to equivalence.