That search algorithm was the first linear-time string searching algorithm and is also named for Morris and Pratt.
This scientist is the first namesake of a procedure that attempts to derive a confluent set of rewrite rules by overlapping left-hand sides of rewrite rules to find critical pairs, then adding the pairs as new rewrite rules to obtain a terminating term rewriting system. That "completion" procedure is named with Peter Bendix. This scientist discovered a class of context-free grammars that's accepted by a shift/reduce parser, a type of deterministic pushdown automaton. This discoverer of LR(k) grammars is the first namesake of a search algorithm that computes a failure function, so it can jump ahead when partial matches are found. He popularized the big Omega and big Theta notations for asymptotic bounds on algorithms. That search algorithm was the first linear-time string searching algorithm and is also named for Morris and Pratt. For 10 points, name this Stanford computer scientist and author of The Art of Computer Programming.
This scientist is the first namesake of a procedure that attempts to derive a confluent set of rewrite rules by overlapping left-hand sides of rewrite rules to find critical pairs, then adding the pairs as new rewrite rules to obtain a terminating term rewriting system.
Donald Knuth