fragile words and cayley type transducers

We address the problem of finding examples of nonbireversible transducers defining free groups, we show examples of transducers with sink accessible from every state which generate free groups, and, in general, we link this problem to the nonexistence of certain words with interesting combinatorial and geometrical properties that we call fragile words. by using this notion, we exhibit a series of transducers constructed from cayley graphs of finite groups whose defined semigroups are free, and thus having exponential growth.