{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":21,"n_cols":5,"rows_kept":21,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[11,2,11,3],[14,2,14,3],[15,2,15,3],[19,2,19,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910452735203321"]
[null,null,"Autore",null,"Haeseler Friedrich von"]
[null,null,"Titolo",null,"Automatic sequences [[electronic resource] /] / by Friedrich von Haeseler"]
[null,null,"Pubbl/distr/stampa",null,"Berlin ; ; New York, : Walter de Gruyter, c2003"]
[null,null,"ISBN",null,"1-281-99345-X"]
[{"$nulls":4},"9786611993450"]
[{"$nulls":4},"3-11-019796-0"]
[null,null,"Edizione",null,"[Reprint 2013]"]
[null,null,"Descrizione fisica",null,"1 online resource (199 p.)"]
[null,null,"Collana",null,"De Gruyter expositions in mathematics ; ; 36"]
[null,null,"Disciplina",null,"515/.24"]
[null,null,"Soggetti",null,"Sequences (Mathematics)"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Electronic books."]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references (p. [177]-188) and index."]
[null,null,"Nota di contenuto",null,"Front matter -- Contents -- Chapter 1. Preliminaries -- Chapter 2. Expanding endomorphisms and substitutions -- Chapter 3. Automaticity -- Chapter 4. Automaticity II -- Chapter 5. Algebraic properties -- Back matter"]
[null,null,null,"Sommario/riassunto","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..."]