 In fact, a deterministic finite state automaton is acyclic if and only if it recognizes a finite set of strings.By allowing the same vertices to be reached by multiple paths, a DAFSA may use significantly fewer vertices than the strongly related trie data structure.Consider, for example, the four English words "tap", "taps", "top", and "tops".