{"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],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[15,2,15,3],[16,2,16,3],[19,2,19,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996466150503316"]
[null,null,"Autore",null,"Skowron Andrzej"]
[null,null,"Titolo",null,"Computation Theory [[electronic resource] ] : Fifth Symposium, Zaborow, Poland, December 3-8, 1984 Proceedings / / by Andrzej Skowron"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1985"]
[null,null,"ISBN",null,"3-540-39748-5"]
[null,null,"Edizione",null,"[1st ed. 1985.]"]
[null,null,"Descrizione fisica",null,"1 online resource (X, 402 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 208"]
[null,null,"Disciplina",null,"510"]
[null,null,"Soggetti",null,"Mathematics"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Computers"]
[{"$nulls":4},"Mathematics, general"]
[{"$nulls":4},"Algorithm Analysis and Problem Complexity"]
[{"$nulls":4},"Theory of Computation"]
[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,"An algorithmic interface structure for pascal compilers -- Nonuniform complexity classes, decision graphs and homological properties of posets -- On the control of concurrent systems by restrictions of the state behaviour -- From domino tilings to a new model of computation -- Nondeterministic Propositional Dynamic Logic with intersection is decidable -- A note on selection networks -- Correctness of inconsistent theories with notions of feasibility -- On the log-space reducibility among array languages /preliminary version/ -- Non-uniformity of dynamic logic -- Model theory of propositional logics of programs, some open problems -- Some results on decision trees with relations to computational trees -- Propositional calculi of term satisfiability and process logics -- On the effectiveness of some operations on algorithms -- Concatenation of program modules an algebraic approach to the semantic and implementation problems -- Regular expressions for infinite trees and a standard form of automata -- Equational ?-calculus -- A logic of indiscernibility relations -- Rough sets and decision tables -- On learning — a rough set approach -- A methodology for improving parallel programs by adding communications -- Extension of PDL and consequence relations -- "]
[{"$nulls":4},"Rough-sets based learning systems -- Theories of interacting stacks -- Rough concepts logic -- An equivalence between indiscernibility relations in information systems and a fragment of intuitionistic logic -- On the recognition of context-free languages -- On multi-valued homomorphisms -- Traces and semiwords -- Deadlock prediction in linear systems -- Propositional dynamic logics with counters and stacks -- Transition graphs semantics and languages -- On the implementation of CSP mechanisms in loglan."]