Cobham's theorem for abstract numeration systems
Émilie Charlier, Julien Leroy, Michel Rigo · Open Repository and Bibliography (University of Luxembourg) · 2013
numeration systems generalize numeration systems whose representation map is increasing and such that the language of all the representations is regular.We show that if a set of integers is recognized by some finite automaton within two independent abstract numeration systems, then this set is a finite union of arithmetic progressions.