Automatic Sequences / / von Friedrich Haeseler.
Automatic sequences are sequences which are produced by a finite automaton. Although they are not random they may look as being random. They are complicated, in the sense of not being not ultimately periodic, they may look rather complicated, in the sense that it may not be easy to name the rule by...
Saved in:
| Superior document: | Title is part of eBook package: De Gruyter DG Expositions in Mathematics Backlist eBook Package |
|---|---|
| VerfasserIn: | |
| Place / Publishing House: | Berlin ;, Boston : : De Gruyter, , [2008] ©2003 |
| Year of Publication: | 2008 |
| Edition: | Reprint 2013 |
| Language: | English |
| Series: | De Gruyter Expositions in Mathematics ,
36 |
| Online Access: | |
| Physical Description: | 1 online resource (191 p.) :; Zahlr. Abb. |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|