Gå direkt till innehållet
Substitutions in Dynamics, Arithmetics and Combinatorics
Spara

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).
Författare
N. Pytheas Fogg
Upplaga
2002 ed.
ISBN
9783540441410
Språk
Engelska
Vikt
310 gram
Utgivningsdatum
2002-09-23
Sidor
404