Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site rochester.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!allegra!mit-eddie!genrad!panda!talcott!harvard!seismo!rochester!ken
From: ken@rochester.UUCP (Ipse dixit)
Newsgroups: net.lang
Subject: Re: Searches for string in a stream
Message-ID: <13779@rochester.UUCP>
Date: Sun, 8-Dec-85 16:32:10 EST
Article-I.D.: rocheste.13779
Posted: Sun Dec  8 16:32:10 1985
Date-Received: Tue, 10-Dec-85 05:05:17 EST
References: <2389@ukma.UUCP> <7839@ucla-cs.ARPA> <13666@rochester.UUCP> <624@ttrdc.UUCP>
Reply-To: ken@rochester.UUCP (Ipse dixit)
Organization: Sans Serif
Lines: 14

In article <624@ttrdc.UUCP> levy@ttrdc.UUCP (Daniel R. Levy) writes:
>Input WORD?  The input to this example was a stream of characters, NOT
>a series of "words", if I can remember correctly.  Does this algorithm
>deal with STREAMS, too?  (I.e., inability to back up, no internal buf-
>fering.)

Sorry for the misunderstanding but I was using word in the theoretical
sense, i.e. a string of symbols. No backtrack is required, it is
totally deterministic.

	Ken
-- 
UUCP: ..!{allegra,decvax,seismo}!rochester!ken ARPA: ken@rochester.arpa
USnail:	Dept. of Comp. Sci., U. of Rochester, NY 14627. Voice: Ken!