{"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":18,"n_cols":5,"rows_kept":18,"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],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[12,2,12,3],[13,2,13,3],[16,2,16,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465643403316"]
[null,null,"Titolo",null,"Graph-Grammars and Their Application to Computer Science and Biology [[electronic resource] ] : International Workshop, Bad Honnef, October 30 - November 3, 1978 / / edited by V. Claus, H. Ehrig, G. Rozenberg"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1979"]
[null,null,"ISBN",null,"3-540-35091-8"]
[null,null,"Edizione",null,"[1st ed. 1979.]"]
[null,null,"Descrizione fisica",null,"1 online resource (X, 486 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 73"]
[null,null,"Disciplina",null,"004.0151"]
[null,null,"Soggetti",null,"Computers"]
[{"$nulls":4},"Computer science"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Computer Science, general"]
[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","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,"Nota di contenuto",null,"to the algebraic theory of graph grammars (a survey) -- A tutorial and bibliographical survey on graph grammars -- Partially-additive monoids, graph-growing, and the algebraic semantics of recursive calls -- Rewriting systems as a tool for relational data base design -- Programmed graph grammars -- Shortest path problems and tree grammars: An algebraic framework -- Constructing specifications of abstract data types by replacements -- Decomposition of graph grammar productions and derivations -- Locally star gluing formulas for a class of parallel graph grammars -- Transformations of data base structures -- Explicit versus implicit parallel rewriting on graphs -- Two-level graph grammars -- A pumping lemma for context-free graph languages -- Two-dimensional, differential, intercalary plant tissue growth and parallel graph generating and graph recurrence systems -- Parallel generation of maps: Developmental systems for cell layers -- Processes in structures -- Map grammars: Cycles and the algebraic approach -- On multilevel — Graph grammars -- Graph grammars and operational semantics -- Complexity of pattern generation by map-L systems -- A graph grammar that describes the set of two-dimensional surface networks -- Definition of programming language semantics using grammars for hierarchical graphs -- Determinism in relational systems -- Analysis of programs by "]
[{"$nulls":4},"reduction of their structure -- Graphs of processors -- Definitional mechanisms for conceptual graphs -- A graph-like lambda calculus for which leftmost-outermost reduction is optimal -- Relationships between graph grammars and the design and analysis of concurrent software -- Cellular graph automata -- List of participants."]