The algorithms presented here are given for the deterministic acyclic finite-state automata (i.e. the classical automata). This makes their comparison with other algorithms easier, as the classical automata are the standard reference. However, versions for deterministic acyclic finite-state automata with final transitions (DAFSA-FT) were implemented. Actually, most implementations have implicit states, so all features of the states are moved to the transitions. This means that they in fact use DAFSA-FTs, but they are not minimal !