Subwords in reverse-complement order - Extended abstract

Abstract We examine flnite words over an alphabet ¡ = fa;„a;b;„bg of pairs of letters, where each word w1w2:::wt is identifled with its reverse complement,„ wt::: „ w2 „ w1 (where „„a = a;„„b = b). We seek the smallest k such that every word of length n; composed from ¡, is uniquely This work was supported, in part, by Hungarian NSF, under contract Nos. AT48826,