Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!linus!decvax!harpo!seismo!hao!hplabs!sri-unix!FOULSER@SU-SCORE.ARPA
From: FOULSER@SU-SCORE.ARPA@sri-unix.UUCP
Newsgroups: net.ai
Subject: Repeated Substring Detection
Message-ID: <3604@sri-arpa.UUCP>
Date: Thu, 28-Jul-83 19:06:46 EDT
Article-I.D.: sri-arpa.3604
Posted: Thu Jul 28 19:06:46 1983
Date-Received: Mon, 1-Aug-83 08:52:28 EDT
Lines: 11

From:  David E.T. Foulser 

Would anyone in AI have use for the following type of program?  Given
a k-dimensional (the lower k the better) input string of characters 
from a finite alphabet, the program finds all substrings of dimension
k (or less if necessary) that occur more than once in the input
string.  I don't have a program that does this, but would like to know
of any interest.

                                        Sincerely,
                                        Dave Foulser