For the multi-peg Tower of Hanoi problem with k 4 pegs, so far the best solution is obtained by the Stewart's algorithm [15] based on the the following recurrence relation: ...
Let N ≥ 2 and let 1 < a1 < · · · < aN be relatively prime integers. The Frobenius number of this N-tuple is defined to be the largest positive integer that has no re...
This article deals with some stochastic population protocols, motivated by theoretical aspects of distributed computing. We modelize the problem by a large urn of black and white ...
Abstract. We show how to represent an interval of real numbers in an abstract numeration system built on a language that is not necessarily regular. As an application, we consider ...
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...