What rhymes with deterministic acyclic finite state automaton?
de·ter·min·is·tic acyclic fi·nite state au·tom·a·ton

In computer science, a deterministic acyclic finite state automaton, also called a directed acyclic word graph is a data structure that represents a set of strings, and allows for a query operation that tests whether a given string belongs to the set in time proportional to its length. In these respects, a DAFSA is very similar to a trie, but it is much more space efficient. A DAFSA is a special case of a finite state recognizer that takes the form of a directed acyclic graph with a single source vertex, in which each edge of the graph is labeled by a letter or symbol, and in which each vertex has at most one outgoing edge for each possible letter or symbol. The strings represented by the DAFSA are formed by the symbols on paths in the graph from the source vertex to any sink vertex. In fact, a deterministic finite state automaton is acyclic if and only if it recognizes a finite set of strings.

more definitions for deterministic acyclic finite state automaton »