Ensembles reconnaissables de séries formelles sur un corps fini

Given the alphabet yielded by a finite field F, we show that infinite words languages that are ω-recognizable correspond exactly to sets definable in the additive group of power series over F together with some natural predicates. In particular, we obtain decidability by automata.