Abstract
We present new characterizations of convergence in Möbius number systems. Moreover, we show how to improve a known result that guarantees the existence of Möbius number systems for some Möbius iterative systems.
As Möbius number systems use subshifts instead of the whole symbolic space, we can ask what is the language complexity of these subshifts. We offer (under some assumptions) a sufficient and necessary condition for a number system to be sofic.