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.

@inproceedings{BlumerBEHM84,
  title = {Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time},
  author = {Anselm Blumer and J. Blumer and Andrzej Ehrenfeucht and David Haussler and Ross M. McConnell},
  year = {1984},
  researchr = {https://researchr.org/publication/BlumerBEHM84},
  cites = {0},
  citedby = {0},
  pages = {109-118},
  booktitle = {Automata, Languages and Programming, 11th Colloquium, Antwerp, Belgium, July 16-20, 1984, Proceedings},
  editor = {Jan Paredaens},
  volume = {172},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-13345-3},
}