Implementation of Iterative Recursion for the Data Retrieval from Directed Acyclic Word Graphs
Reference1 articles.
1. [I] A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, R. McConnell, Building the minimal DFA for the set of all subwords of a word online in linear time, in: J. Paredaens (Ed.), Lecture Notes in Computer Science, Vol. 172, Springer, Belgium, 1984, pp. 109-118.