We prove a pumping lemma in order to characterize the infinite words determined by indexed languages. An infinite language L determines an infinite word α if every string in L is a prefix of α. If L is regular or context-free, it is known that α must be ultimately periodic. We show that if L is an indexed language, then α is a morphic word, i.e., α can be generated by iterating a morphism under...

We characterize the infinite words determined by indexed languages. An infinite language L determines an infinite word α if every string in L is a prefix of α. If L is regular or context-free, it is known that α must be ultimately periodic. We show that if L is an indexed language, then α is a morphic word, i.e., α can be generated by iterating a morphism under a coding. Since the other directi...

This work contributes to two aspects of the understanding of infinite words: the frequency of letters in a morphic sequence and periodicity considerations on infinite words. First, we develop a necessary and sufficient criteria for the existence of the frequency of a letter in a morphic sequence, and give some applications of this result. We show that the frequencies of all letters exist in pur...

The article is aimed at a study of the process metaphorization involved in formation professional jargonisms field Anglo-American jurisprudence. Distinction made between motivated and unmotivated metaphorical jargonisms. author highlighted main source domains anthropomorphic, socio-morphic, artefactual, natural-morphic models English-speaking lawyers. Professionally significant slang names subj...

Thue proved that the factors occurring infinitely many times in square-free words over {0,1,2} avoiding the factors in {010,212} are the factors of the fixed point of the morphism 0 7→ 012, 1 7→ 02, 2 7→ 1. He similarly characterized square-free words avoiding {010,020} and {121,212} as the factors of two morphic words. In this paper, we exhibit smaller morphisms to define these two square-free...