Directed acyclic word graph

Directed acyclic word graph may refer to two related, but distinct, automata constructions in computer science:

Deterministic acyclic finite state automaton, a data structure that represents a finite set of strings
Suffix automaton, a finite automaton that functions as a suffix index

This article is issued from Wikipedia - version of the 2/22/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.