Finite maximal infix codes
A set \(X\) of words over an alphabet \(A\) is an infix code, if no word in \(X\) is a factor of any other word in \(X\). The author first shows that any finite infix code can be completed to a finite maximal infix code. In the main results of the paper he proves that every maximal infix code can be produced from the underlying alphabet \(A\) by finitely many successive applications of two kinds of set-transformations.
scientific article; zbMATH DE number 1545247