Abstract
Several constructions exist for the free inverse semigroup FI X with a set X of free generators. We offer a new construction that describes elements of FI X 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 FI X follow.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
