Matthew B. Squire

Learn More
For any q ≥ 2, let Σq = {0, . . . , q−1}, and fix a string A over Σq. The A-free strings of length n are the strings in Σq which do not contain A as a contiguous substring. In this paper, we investigate the possibility of listing the A-free strings of length n so that successive strings differ in only one position, and by ±1 in that position. Such a listing(More)
  • 1