Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time

Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell. Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time. In Jan Paredaens, editor, Automata, Languages and Programming, 11th Colloquium, Antwerp, Belgium, July 16-20, 1984, Proceedings. Volume 172 of Lecture Notes in Computer Science, pages 109-118, Springer, 1984.

Bibliographies