Christol, Gilles Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets). (French) Zbl 0402.68044 Theor. Comput. Sci. 9, 141-145 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 12 ReviewsCited in 73 Documents MSC: 68Q45 Formal languages and automata 68Q70 Algebraic theory of languages and automata 11B85 Automata sequences Keywords:automata; recognizable sets Citations:Zbl 0317.94045 × Cite Format Result Cite Review PDF Full Text: DOI References: [1] Baum, L. E.; Herzberg, N. P.; Lomonaco, S. J.; Sweet, M. M., Field of Almost Periodic Sequences, J. Combinatorial Theory Ser. A, 22, 169-180 (1977) · Zbl 0354.12020 [2] Christol, G., Limites uniformes \(p\)-adiques de fonctions algébriques, Thèse Sciences Math. (1977), Paris [3] Eilenberg, Automata, Languages and Machines, Vol. A (1974), Academic Press: Academic Press New York · Zbl 0317.94045 [4] Furstenberg, H., Algebraic functions over finite fields, J. Algebra, 7, 271-277 (1967) · Zbl 0175.03903 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.