Thin and slender languages

AbstractThe paper investigates languages containing at most one word of every length, or a number of words bounded by a constant independent of the length. The study of such languages is closely related to some fundamental issues of classical formal language theory. Recent considerations have arisen in connection with some problems in cryptography. The present paper gives characterization results in the case of regular and context-free languages, as well as investigates decision problems