{"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":23,"n_cols":5,"rows_kept":23,"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],[3,2,3,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[10,2,10,3],[11,2,11,3],[15,2,15,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910783144503321"]
[null,null,"Titolo",null,"A half-century of automata theory [[electronic resource] ] : celebration and inspiration / / editors, A. Salomaa, D. Wood, S. Yu"]
[null,null,"Pubbl/distr/stampa",null,"River Edge, N.J., : World Scientific, c2001"]
[null,null,"ISBN",null,"1-281-95168-4"]
[{"$nulls":4},"9786611951689"]
[{"$nulls":4},"981-281-016-1"]
[null,null,"Descrizione fisica",null,"1 online resource (164 p.)"]
[null,null,"Disciplina",null,"511.3"]
[null,null,"Soggetti",null,"Machine theory"]
[{"$nulls":4},"Algebra"]
[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."]
[null,null,"Nota di contenuto",null,"CONTENTS               ; Preface              ; Hazard Algebras (Extended Abstract)                                          ; 1 Introduction                     ; 2 Transients                   ; 3 Change-Counting Algebra                                ; 4 Counting Changes to a Threshold                                        ; 5 Circuit Simulations                            ; 6 Extensions of Boolean Functions                                        ; 7 Complexity Issues                          ; 8 Conclusions                    ; References"]
[{"$nulls":4},"Undecidability and Incompleteness Results in Automata Theory                                                                   1 Introduction                     ; 2 Basic Concepts and II2-Completeness; 3 Undecidability and Incompleteness Results                                                  ; 4 Representation Independent Incompleteness Results                                                          ; 5 Incomplete Languages                             ; 6 Minimal Automata and Incompleteness                                            ; 7 Succinctness Results"]
[{"$nulls":4},"8 Conclusion                   References                 ; Automata Theory: Its Past and Future                                           ; 1 Introduction                     ; 2 Beginnings of Automata Theory                                      ; 3 External Changes Impacting Future Directions                                                     ; 4 Conclusions                    ; References                 ; Forty Years of Formal Power Series in Automata Theory                                                            ; 1 Introduction"]
[{"$nulls":4},"2 Continuous monoids and semirings                                         3 Automata and the Theorem of Kleene                                           ; 4 Algebraic systems and pushdown automata                                                "]
[{"$nulls":4},"; 5 Principal cones of algebraic power series                                                  ; 6 Decidability questions                               ; References                 ; Playing Infinite Games in Finite Time                                            ; 1 Infinite games                       ; 2 The score function"]
[{"$nulls":4},"3 Theoretical results about scoring                                          4 When to end the play                             ; 5 Finding playable games                               ; 6 A specific suggestion                              ; References                 ; Gene Assembly in Ciliates: Computing by Folding and Recombination                                                                        ; Introduction.                    ; 1 Preliminaries.                       ; 2 DNA molecules: structure and notation."]
[{"$nulls":4},"3 Gene assembly in ciliates."]
[null,null,null,"Sommario/riassunto","This volume gathers lectures by 8 distinguished pioneers of automata theory, including two Turing Award winners. In each contribution, the early developments of automata theory are reminisced about and future directions are suggested. Although some of the contributions go into rather intriguing technical details, most of the book is accessible to a wide audience interested in the progress of the age of computers.  The book is a must for professionals in theoretical computer science and related areas of mathematics. For students in these areas it provides an exceptionally deep view at the begi"]