{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"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":31,"n_cols":5,"rows_kept":31,"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],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[11,2,11,3],[11,4,11,5],[12,2,12,3],[12,4,12,5],[13,2,13,3],[14,2,14,3],[15,2,15,3],[16,2,16,3],[17,2,17,3],[18,2,18,3],[19,2,19,3],[25,2,25,3],[26,2,26,3],[29,2,29,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA990000710620203316"]
[null,null,"Autore",null,"FERREIRA, Maria Ema Tarracha"]
[null,null,"Titolo",null,"Antologia literária comentada : século 19. : do romanticismo ao realismo / M.Ema Tarracha Ferreira"]
[null,null,"Pubbl/distr/stampa",null,"[S.l.] : Ulisseia, [19-?]"]
[null,null,"Descrizione fisica",null,"332 p. ; 21 cm"]
[null,null,"Disciplina",null,"869"]
[null,null,"Soggetti",null,"Letteratura portoghese - Antologie - Sec.19"]
[null,null,"Collocazione",null,"II.6.D.8"]
[null,null,"Lingua di pubblicazione",null,"Portoghese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,"2.","Record Nr.",null,"UNISA996465763803316"]
[null,null,"Titolo",null,"Automata, Languages and Programming [[electronic resource] ] : Seventh Colloquium, Noordwijkerhout, The Netherlands, July 14-18, 1980. Proceedings / / edited by J. W. de Bakker, J. van Leeuwen"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1980"]
[null,null,"ISBN",null,"3-540-39346-3"]
[null,null,"Edizione",null,"[1st ed. 1980.]"]
[null,null,"Descrizione fisica",null,"1 online resource (X, 671 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 85"]
[null,null,"Disciplina",null,"005.11"]
[null,null,"Soggetti",null,"Computer programming"]
[{"$nulls":4},"Computers"]
[{"$nulls":4},"Mathematical logic"]
[{"$nulls":4},"Programming Techniques"]
[{"$nulls":4},"Computation by Abstract Devices"]
[{"$nulls":4},"Mathematical Logic and Formal Languages"]
[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,"How to get rid of pseudoterminals -- Test sets for homomorphism equivalence on context free languages -- Languages with homomorphic replacements -- Functions equivalent to integer multiplication -- Languages with reducing reflexive types -- Semantics of unbounded nondeterminism -- A shifting algorithm for min-max tree partitioning -- A characterisation of computable data types by means of a finite equational specification method -- A note on sweeping automata -- Border rank of a p×q×2 tensor and the optimal approximation of a pair of bilinear forms -- Derivations et reductions dans les grammaires algebrioues -- Semantic analysis of communicating sequential processes -- Dos systems and languages -- Algebraic implementation of abstract data types: concept, syntax, semantics and correctness -- Parameterized data types in algebraic specification languages -- Characterizing correctness properties of parallel programs using fixpoints -- Formal properties of one-visit and multi-pass attribute grammars (extended abstract) -- Cryptocomplexity and NP-completeness -- On the analysis of tree-matching algorithms -- Generating and searching sets induced by networks -- The complexity of the inequivalence problem for regular "]
[{"$nulls":4},"expressions with intersection -- An almost linear time algorithm for computing a dependency basis in a relational data base -- Bipolar synchronization systems -- Testing of properties of finite algebras -- A transaction model -- On observing nondeterminism and concurrency -- Terminal algebra semantics and retractions for abstract data types -- The complexity of semilinear sets -- A theory of nondeterminism -- A representation theorem for models of *-free PDL -- Present-day Hoare-like systems for programming languages with procedures: Power, limits and most likely extensions -- Symmertric space-bounded computation (extended abstract) -- On some properties of local testability -- Semantics :Algebras,fixed points,axioms -- Measuring the expressive power of dynamic logics: An application of abstract model theory -- Pebbling mountain ranges and its application to DCFL-recognition -- Space-restricted attribute grammars -- A constructive approach to compiler correctness -- A worst-case analysis of nearest neighbor searching by projection -- Proprietes syntactiques du produit non ambigu -- On the optimal assignment of attributes to passes in multi-pass attribute evaluators -- Optimal unbounded search strategies -- A \"fast implementation\" of a multidimensional storage into a tree storage -- Grammatical families -- Partitioned chain grammars -- An improved program for constructing open hash tables -- On the power of commutativity in cryptography -- Characterizations of the LL(k) property -- Computability in categories -- On the size complexity of monotone formulas -- Reversible computing -- The use of metasystem transition in theorem proving and program optimization -- On the power of real-time turing machines under varying specifications."]