A new construction for free inverse semigroups

Several constructions exist for the free inverse semigroup FIX with a set X of free generators. We offer a new construction that describes elements of FIX as shortest words in the classes of equivalent words over the alphabet X∪X−1 and produce an algorithm that transforms any word into its shortest equivalent form. Both known and new properties of FIX follow.