The Frobenius problem for homomorphic embeddings of languages into the integers
Michel Dekking (TU Delft - Applied Probability)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
Let S be a map from a language Lto the integers satisfying S(vw) =S(v) +S(w)for all v, w ∈L. The classical Frobenius problem asks whether the complement of S(L)in the natural numbers will be infinite or finite, and in the latter case the value of the largest element in this complement. This is also known as the ‘coin-problem’, and Lis the full language consisting of all words over a finite alphabet. We solve the Frobenius problem for the golden mean language, any Sturmian language and the Thue–Morse language. We also consider two-dimensional embeddings.
help_outline