•  
  •  
 

Article Title

Terminal Bigrams

Authors

Philip M. Cohen

Abstract

This article reports progress on what I call the '1352 Problem': finding words that begin or end with each of the 676 possible two-letter combinations. Earlier results are given in Dmitri Borgmann's 'Zero Redundancy!' in his book Beyond Language (Problem 137), Darryl Francis's 'Zero Redundancy Rides Again' in the August 1970 Word Ways, and my 'Initial Bigrams' and 'Final Bigrams' in the May and August 1975 Word Ways.

Share

COinS