Serial classification of fragments of words
В. К. Леонтьев · Doklady Mathematics · 2015
A serial representation of words over a finite alphabet and a serial representation of word fragments are studied. In particular, it is shown that any word can be reconstructed from the set of all of its one-series and two-series fragments.