We give necessary and sufficient conditions for a language to be the language of finite words that occur infinitely many times in an infinite word.
@article{ITA_2005__39_4_641_0,
author = {Thomsen, Klaus},
title = {Languages of finite words occurring infinitely many times in an infinite word},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
volume = {39},
year = {2005},
pages = {641-650},
doi = {10.1051/ita:2005033},
mrnumber = {2172143},
language = {en},
url = {http://dml.mathdoc.fr/item/ITA_2005__39_4_641_0}
}
Thomsen, Klaus. Languages of finite words occurring infinitely many times in an infinite word. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 39 (2005) pp. 641-650. doi : 10.1051/ita:2005033. http://gdmltest.u-ga.fr/item/ITA_2005__39_4_641_0/
[1] , and, On formal properties of simple phrase structure grammar. Z. Phonetik. Sprachwiss. Komm. 14 (1961) 143-172. | Zbl 0106.34501
[2] and, Languages obtained from infinite words. RAIRO-Inf. Theor. Appl. 31 (1997) 445-455. | Numdam | Zbl 0903.68115
[3] and, Introduction to Automata Theory, Languages and Computation. Addison-Wesley Publishing Company (1979). | MR 645539 | Zbl 0426.68001
[4] , On subwords of infinite words. Discrete Appl. Math. 63 (1995) 277-279. | Zbl 0856.68116
[5] and, An Introduction to Symbolic Dynamics and Coding. Cambridge University Press (1995). | MR 1369092 | Zbl 1106.37301
[6] and, Infinite (almost periodic) words, formal languages and dynamical systems. Bull. EATCS 54 (1994) 224-231. | Zbl 0825.68388