| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10181006 | Comptes Rendus Mathematique | 2016 | 5 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Mathematics (General)
Authors
Luc Bélair, Maxime Gélinas, Françoise Point,