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.

Authors

Anselm Blumer

This author has not been identified. Look up 'Anselm Blumer' in Google

J. Blumer

This author has not been identified. Look up 'J. Blumer' in Google

Andrzej Ehrenfeucht

This author has not been identified. Look up 'Andrzej Ehrenfeucht' in Google

David Haussler

This author has not been identified. Look up 'David Haussler' in Google

Ross M. McConnell

This author has not been identified. Look up 'Ross M. McConnell' in Google