אריה קנטורוביץ

We define the family of n-gram embeddings from strings over a finite alphabet into the semimodule double struck N sign^K. We classify all ζ ∈ double struck N sign^k that are valid images of strings under such embeddings, as well as all ζ whose inverse image consists of exactly 1 string (we call such ζ uniquely decodable). We prove that for a fixed alphabet, the set of all strings whose image is uniquely decodable is a regular language.