Multi-dimensional sets recognizable in all abstract numeration systems
Formal Languages and Automata Theory
2010-10-27 v1
Abstract
We prove that the subsets of N^d 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.
Cite
@article{arxiv.1010.5391,
title = {Multi-dimensional sets recognizable in all abstract numeration systems},
author = {Emilie Charlier and Anne Lacroix and Narad Rampersad},
journal= {arXiv preprint arXiv:1010.5391},
year = {2010}
}
Comments
11 pages