Cargando…
Substitutions in dynamics, arithmetics and combinatorics
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 itera...
| Autores principales: | , , , , |
|---|---|
| Lenguaje: | eng |
| Publicado: |
Springer
2002
|
| Materias: | |
| Acceso en línea: | https://dx.doi.org/10.1007/b13861 http://cds.cern.ch/record/1691428 |