Revision as of 23:46, 30 October 2023 edit Trappist the monk (talk \| contribs) Administrators 494,453 edits m →top: cite repair; Tag: AWB ← Previous edit		Revision as of 00:19, 31 October 2023 edit undo AnomieBOT (talk \| contribs) Bots 6,856,596 edits m Substing templates: {{Format ISBN}}. See User:AnomieBOT/docs/TemplateSubster for info. Next edit →
Line 5: The [[algorithm]] was conceived by [[James H. Morris]] and independently discovered by [[Donald Knuth]] "a few weeks later" from [[automata theory]].<ref name=knuth1977> {{cite journal\|last1=Knuth\|first1=Donald\|last2=Morris\|first2=James H.\|last3=Pratt\|first3=Vaughan\|title=Fast pattern matching in strings\|journal=SIAM Journal on Computing\|date=1977\|volume=6\|issue=2\|pages=323–350\|doi=10.1137/0206024\|citeseerx=10.1.1.93.8147}}</ref><ref> {{cite journal \| last1=Knuth \| first1=Donald E. \| title=The Dangers of Computer-Science Theory \| journal=Studies in Logic and the Foundations of Mathematics \| volume=74 \| year=1973 \| pages=189–195 \| doi=10.1016/S0049-237X(09)70357-X\| isbn=~~{{Format ISBN\|9780444104915}}~~978-0-444-10491-5 }}</ref> Morris and [[Vaughan Pratt]] published a technical report in 1970.<ref> {{cite tech report \| last1=Morris \| first1=J.H. Jr \| last2=Pratt \| first2=V. \| title=A linear pattern-matching algorithm \| number=TR-40 \| year=1970 \| institution=University of California, Berkeley, Computation Center}}</ref>

Knuth–Morris–Pratt algorithm: Difference between revisions