FOULSER@SU-SCORE.ARPA@sri-unix.UUCP (07/29/83)
From: David E.T. Foulser <FOULSER@SU-SCORE.ARPA> 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