On the algorithmic complexity of some numeration-related problems

In this paper, we give explicit upper bounds on the algorithmic complexity of some problems related to matrix-based numeration systems. We consider different types of deterministic algorithms, and compare their worst-case time and space complexity. We also analyze probabilistic algorithms, and examine the question whether they can serve as a reliable alternative.