{"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],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[14,2,14,3],[15,2,15,3],[18,2,18,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465826803316"]
[null,null,"Titolo",null,"Automata, Languages and Programming [[electronic resource] ] : 14th International Colloquium, Karlsruhe, Federal Republic of Germany, July 13-17, 1987. Proceedings / / edited by Thomas Ottmann"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987"]
[null,null,"ISBN",null,"3-540-47747-0"]
[null,null,"Edizione",null,"[1st ed. 1987.]"]
[null,null,"Descrizione fisica",null,"1 online resource (X, 565 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 267"]
[null,null,"Disciplina",null,"003.3"]
[null,null,"Soggetti",null,"Architecture, Computer"]
[{"$nulls":4},"Computers"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Computer System Implementation"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Algorithm Analysis and Problem Complexity"]
[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,"Probability and plurality for aggregations of learning machines -- Logic programming with ions -- Inverse image analysis -- A unification algorithm for confluent theories -- On the Knuth-Bendix completion for concurrent processes -- On word problems in equational theories -- Semantics for nondeterministic asynchronous broadcast networks -- Another look at abstraction in process algebra -- A timed failures model for extended communicating processes -- Readiness semantics for regular processes with silent actions -- Verifying a protocol using relativized bisimulation -- On recent trends in formal language theory -- Non-uniform automata over groups -- Minimal automaton of a rational cover -- A star-height problem in free monoids with partial commutations -- Single-valued finite transduction -- The kleene and the Parikh Theorem in complete semirings -- An algorithm for computing asynchronous automata in the case of acyclic non-commutation graphs -- On the languages accepted by finite reversible automata -- Decision problems for regular trace languages -- Panic mode without panic -- Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree -- Modelchecking of CTL formulae under liveness assumptions -- A modal logic for a "]
[{"$nulls":4},"subclass of event structures -- Parallel 5-colouring of planar graphs -- Parallel construction of a suffix tree -- The probabilistic and deterministic parallel complexity of symmetric functions -- Term matching on parallel computers -- Guessing games and distributed computations in synchronous networks -- On the bivariate function minimization problem and its applications to motion planning -- Testing the necklace condition for Shortest Tours and optimal factors in the plane -- Nearly optimal heuristics for binary search trees with geometric generalizations -- Approximating integer lattices by lattices with cyclic factor groups -- On the complexity of graph critical uncolorability -- Posets, boolean representations and quick path searching -- The lexicographically first maximal subgraph problems: P-completeness and NC algorithms -- Uniform computational complexity of Taylor series -- Efficient on-line algorithms for the knapsack problem -- Lower bounds for sorting of sums -- The I/O complexity of sorting and related problems -- A lower bound for the complexity of the Union-Split-Find problem -- The nearest common ancestor in a dynamic tree -- A generalization of the procedure of karp and miller to well structured transition systems -- Completeness results for reachability, containment, and equivalence, with respect to conflict-free vector replacement systems -- Partial algebras flow from algebraic specifications -- The logarithmic alternation hierarchy collapses: AΣL2=AΠL2  -- Testing membership in commutative transformation semigroups -- On the computing power of one-way cellular arrays -- Recent developments in the theory of learning."]
[null,null,null,"Sommario/riassunto","This volume contains the proceedings of the 14th International Colloquium on Automata Languages and Programming, organized by the European Association for Theoretical Computer Science (EATCS) and held in Karlsruhe, July 13-17, 1987. The papers report on original research in theoretical computer science and cover topics such as algorithms and data structures, automata and formal languages, computability and complexity theory, semantics of programming languages, program specification, transformation and verification, theory of data bases, logic programming, theory of logical design and layout, parallel and distributed computation, theory of concurrency, symbolic and algebraic computation, term rewriting systems, cryptography, and theory of robotics. The authors are young scientists and leading experts in these areas."]