| Issue |
RAIRO-Theor. Inf. Appl.
Volume 46, Number 1, January-March 2012
Special issue dedicated to the 13th "Journées Montoises d'Informatique Théorique"
|
|
|---|---|---|
| Page(s) | 51 - 65 | |
| DOI | https://doi.org/10.1051/ita/2011112 | |
| Published online | 25 August 2011 | |
Multi-dimensional sets recognizable in all abstract numeration systems
Department of Mathematics, University of Liège, Grande Traverse 12 (B37), 4000 Liège, Belgium
echarlier@ulg.ac.be, A.Lacroix@ulg.ac.be, nrampersad@ulg.ac.be
Received: 2 November 2010
Accepted: 29 June 2011
We prove that the subsets of that are S-recognizable for all abstract numeration systems S are exactly the 1-recognizable sets. This generalizes a result of Lecomte and Rigo in the one-dimensional setting.
Mathematics Subject Classification: 68Q45
Key words: Finite automata / numeration systems / recognizable sets of integers / multi-dimensional setting
© EDP Sciences 2011
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.