ABSTRACT
By the term Directed Acyclic Word Graphs (DAWG) we refer to a certain type of data structures which facilitate the handling (storing, deleting, retrieving and modifying) of several data. In this paper we use the notion of the term DAWG as used by Perrin [5] and Aoe et al. [7], meaning acyclic FSAs storing word lexicons, in contrast to the second notion of the term (used by e.g Crochemore and Verin [12]) meaning the suffix automaton of a string.
