Automatic Sequences / / von Friedrich Haeseler.

• Superior document: Title is part of eBook package: De Gruyter DG Expositions in Mathematics Backlist eBook Package
• VerfasserIn: Haeseler, von Friedrich,
• 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
• Physical Description: 1 online resource (191 p.) :; Zahlr. Abb.
• Other title: Frontmatter --; Contents --; Chapter 1. Preliminaries --; Chapter 2. Expanding endomorphisms and --; substitutions --; Chapter 3. Automaticity --; Chapter 4. Automaticity II --; Chapter 5. Algebraic properties --; Backmatter
• Format: Mode of access: Internet via World Wide Web.
• ISBN: 9783110197969; 9783110494969; 9783110238570; 9783110238471; 9783110637205; 9783110212129; 9783110212136; 9783110209082
• ISSN: 0938-6572
• DOI: 10.1515/9783110197969
• Access: restricted access
• Hierarchical level: Monograph
• Statement of Responsibility: 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 which the sequence is generated, however there exists a rule which generates the sequence. The concept automatic sequences has special applications in algebra, number theory, finite automata and formal languages, combinatorics on words. The text deals with different aspects of automatic sequences, in particular:· a general introduction to automatic sequences· the basic (combinatorial) properties of automatic sequences· the algebraic approach to automatic sequences· geometric objects related to automatic sequences.