%0 Conference Paper %1 conf/icalp/BlumerBEHM84 %A Blumer, Anselm %A Blumer, J. %A Ehrenfeucht, Andrzej %A Haussler, David %A McConnell, Ross M. %B ICALP %D 1984 %E Paredaens, Jan %I Springer %K dblp %P 109-118 %T Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time. %U http://dblp.uni-trier.de/db/conf/icalp/icalp84.html#BlumerBEHM84 %V 172 %@ 0-387-13345-3

@inproceedings{conf/icalp/BlumerBEHM84, added-at = {2020-05-30T00:00:00.000+0200}, author = {Blumer, Anselm and Blumer, J. and Ehrenfeucht, Andrzej and Haussler, David and McConnell, Ross M.}, biburl = {https://www.bibsonomy.org/bibtex/2f213a8e0703e59f64cba6ca5e0602e8c/dblp}, booktitle = {ICALP}, crossref = {conf/icalp/1984}, editor = {Paredaens, Jan}, ee = {https://www.wikidata.org/entity/Q90309073}, interhash = {d9fa7de2a8be6857ba0c1715848834ec}, intrahash = {f213a8e0703e59f64cba6ca5e0602e8c}, isbn = {0-387-13345-3}, keywords = {dblp}, pages = {109-118}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2020-06-02T12:38:31.000+0200}, title = {Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time.}, url = {http://dblp.uni-trier.de/db/conf/icalp/icalp84.html#BlumerBEHM84}, volume = 172, year = 1984 }