Cubic Pisot Unit Combinatorial Games

Generalized Tribonacci morphisms are de ned on a three letters alphabet and generate the so-called generalized Tribonacci words. We present a family of combinatorial removal games on three piles of tokens whose set
of P-positions is coded exactly by these generalized Tribonacci words. To obtain this result, we study combinatorial properties of these words like gaps between consecutive identical letters or recursive de nitions of these words. Beta-numeration systems are then used to show that these games are tractable, i.e., deciding whether a position is a P-position can be checked in polynomial time.