Re: Does anyone have a copy of this paper? Knuth's Fast pattern matching in strings

From: Matthias Klaey <mpky@xxxxxxxxxxx>
Date: Fri, 15 Jun 2007 03:20:38 +0200

sail0r <sail0r@xxxxxxxxxxxxxx> wrote:

The full citation is:
Knuth D.E., Morris J.H., and Pratt V.R., Fast pattern matching in
strings, SIAM Journal on Computing, 6(2), 323-350, 1977.
Due to various circumstances it would be great if someone could email
me a copy as I cannot get to a library in the near future.
Thanks!

http://siamdl.aip.org/dbt/dbt.jsp?KEY=SMJCAT&Volume=6&Issue=2

.... this costs you 23$

HTH
Matthias Kläy
--
www.kcc.ch
.

References:
- Does anyone have a copy of this paper? Knuth's Fast pattern matching in strings
  - From: sail0r

Prev by Date: Does anyone have a copy of this paper? Knuth's Fast pattern matching in strings
Next by Date: Graph - find a path from A to B with path constraints
Previous by thread: Does anyone have a copy of this paper? Knuth's Fast pattern matching in strings
Next by thread: Graph - find a path from A to B with path constraints
Index(es):
- Date
- Thread

Relevant Pages

Re: Entropy
... There is quite some material out there which proves that computing KC on any *finite* sentence is not possible. ... So it makes no difference for the "incomputability" if you take finite or infinite inputs. ... the concept of KC on finite strings (even though all textbooks I ... There is a universal partial recursive function ...
(comp.compression)
Re: Someone said 256 bits is not enough
... computing - some of them often put out such "facts". ... Here's something I don't understand about quantum computing... ... then apply what are essentially filters to keep strings that match ... and you basically apply an optimization algorithm; ...
(sci.crypt)
Re: Someone said 256 bits is not enough
... computing - some of them often put out such "facts". ... I was trying to describe my assumptions as "not a quantum computer". ... then apply what are essentially filters to keep strings that match ... and you basically apply an optimization algorithm; ...
(sci.crypt)
Re: CompareTo issue.
... Maybe you can explain what's so hard about sorting strings. ... It's a pretty basic requirement in computing. ... I'm trying to sort a list to use in a binary search, ... "Sijin Joseph" wrote: ...
(microsoft.public.dotnet.general)
Re: datagrid format question
... You can get the time interval by converting both date strings to date types ... and computing the difference. ... > I need this to be formatted in a way that I can subtract the two times and ...
(microsoft.public.dotnet.framework.aspnet.datagridcontrol)