A certain category of infinite strings of letters on a finite alphabet is presented here, chosen among the ''simplest'' possible one may build, both because they are very deterministic and because they are built by simple rules (a letter is replaced by a word, a sequence is produced by iteration). These substitutive sequences have a surprisingly rich structure.
The authors describe the concepts of quantity of natural interactions, with combinatorics on words, ergodic theory, linear algebra, spectral theory, geometry of tilings, theoretical computer science, diophantine approximation, trancendence, graph theory. This volume fulfils the need for a reference on the basic definitions and theorems, as well as for a state-of-the-art survey of the more difficult and unsolved problems.