02815nam 22006854a 450 991045273520332120210524213513.01-281-99345-X97866119934503-11-019796-010.1515/9783110197969(CKB)1000000000520542(EBL)314060(OCoLC)232160051(SSID)ssj0000107959(PQKBManifestationID)11138198(PQKBTitleCode)TC0000107959(PQKBWorkID)10017247(PQKB)11035273(MiAaPQ)EBC314060(DE-B1597)32309(OCoLC)979583672(DE-B1597)9783110197969(PPN)175486344(PPN)139872051(Au-PeEL)EBL314060(CaPaEBR)ebr10194878(CaONFJC)MIL199345(EXLCZ)99100000000052054220020822d2003 uy 0engurun#---|u||rtxtccrAutomatic sequences[electronic resource] /by Friedrich von HaeselerReprint 2013Berlin ;New York Walter de Gruyterc20031 online resource (199 p.)De Gruyter expositions in mathematics ;36Description based upon print version of record.3-11-015629-6 Includes bibliographical references (p. [177]-188) and index.Front matter --Contents --Chapter 1. Preliminaries --Chapter 2. Expanding endomorphisms and substitutions --Chapter 3. Automaticity --Chapter 4. Automaticity II --Chapter 5. Algebraic properties --Back matterAutomatic 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...Gruyter expositions in mathematics ;36.Sequences (Mathematics)AlgorithmsElectronic books.Sequences (Mathematics)Algorithms.515/.24Haeseler Friedrich von726753MiAaPQMiAaPQMiAaPQBOOK9910452735203321Automatic sequences1422123UNINA