Efficient insertion of deterministic acyclic finite state automaton (DAFSA) into a suffix tree?


I have a problem where I can easily construct a set of deterministic acyclic finite state automata (DAFSA) and I need a full-text search index, e.g. a suffix tree, over all the words encoded by these automata.

Is there an efficient algorithm for inserting all the words encoded in a DAFSA into a suffix tree? By efficient I mean that the complexity must not depend on the on the total number of words encoded in the DAFSA.