COMBINATORICS OF WORDS COMBINATORICS OF WORDS AND ARITHMETICS AND ARITHMETICS CIMPA S

There exists a bijection between the class of trees of size n having two stems per node, and the class of rooted triangulations with n +

۝ Problem 4. Here’s a table of the natural numbers which are lower than 100.. 1) We want to keep the prime numbers, and to eliminate the numbers which are not prime. What’s

La difficulté de cette tâche a été volontairement augmentée, afin de voir dans quelle mesure un algorithme évolutionniste peut trouver des solutions à un problème très diffi-

For instance, Arnoux-Rauzy substitutions are known to be Pisot [1] and thus to generate finitely balanced Arnoux- Rauzy words.. Here, finitely balanced means that they are

- Pierre Arnoux, Université de la Méditerranée, - Pierre Cartier, École Normale Supérieure de Paris, - Julien Cassaigne, Institut de Mathématiques de Luminy, - Sébastien

- Other notions of complexity for infinite words were defined by S´ ebastien Ferenczi and Zolt´ an K´ asa in their paper of WORDS 1997: the behavior of upper (lower) total

In the workshop of 2007, several contributions to the topic are also presented: Nicolas B´ edaride, Eric Domenjoud, Damien Jamet and Jean-Luc Remy study the number of balanced words

mean values of the three parameters (covered space, discrepancy and Arnold mea- sure) share the same behaviour in the four probabilistic models (real versus rational,