Higman showed that if A is *any* language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. (The result we attribute to Higman is actually an easy consequence of his work.) Let s_1, s_2, s_3, ... be the standard lexicographic enumeration of all ... more >>>