On the periodicity of word-length in DOL languages

Autor: Seymour Ginsburg, Branislav Rovan
Rok vydání: 1974
Předmět:
Zdroj: Information and Control. 26:34-44
ISSN: 0019-9958
Popis: The following result is established: Let L be a DOL language and x1, x2,…, a sequence of all words in L ordered by increasing length. Suppose that for some integer ko there exist arbitrarily long intervals xi,…, xi+l such that | xj+1 | − | xj | ⩽ k0 for each j, i ⩽ j < i + l. Then the sequence [| xj+1 | − | xj|]i⩾1 is periodic.
Databáze: OpenAIRE