Gå direkte til innholdet
Substitutions in Dynamics, Arithmetics and Combinatorics
Spar

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 iteration).
Opplag
2002 ed.
ISBN
9783540441410
Språk
Engelsk
Vekt
310 gram
Utgivelsesdato
23.9.2002
Antall sider
404