{"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":35,"n_cols":5,"rows_kept":35,"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],[16,2,16,3],[17,2,17,3],[21,2,21,3],[23,2,23,3],[23,4,23,5],[24,2,24,3],[24,4,24,5],[25,2,25,3],[25,4,25,5],[26,2,26,3],[27,2,27,3],[28,2,28,3],[29,2,29,3],[30,2,30,3],[31,2,31,3],[32,2,32,3],[33,2,33,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996466089903316"]
[null,null,"Titolo",null,"Implementation and Application of Automata [[electronic resource] ] : 10th International Conference, CIAA 2005, Sophia Antipolis, France, June 27-29, 2005, Revised Selected Papers / / edited by Jacques Farré, Igor Litovsky, Sylvain Schmitz"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006"]
[null,null,"ISBN",null,"3-540-33097-6"]
[null,null,"Edizione",null,"[1st ed. 2006.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XIII, 360 p.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 3845"]
[null,null,"Disciplina",null,"511.3"]
[null,null,"Soggetti",null,"Artificial intelligence"]
[{"$nulls":4},"Computer science"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Machine theory"]
[{"$nulls":4},"Artificial Intelligence"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Computer Science Logic and Foundations of Programming"]
[{"$nulls":4},"Formal Languages and Automata Theory"]
[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,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Invited Lectures -- Languages Recognizable by Quantum Finite Automata -- The Language, the Expression, and the (Small) Automaton -- Technical Contributions -- Minimization of Non-deterministic Automata with Large Alphabets -- Simulating Two-Dimensional Recognizability by Pushdown and Queue Automata -- Component Composition Preserving Behavioural Contracts Based on Communication Traces -- Strong Retiming Equivalence of Synchronous Schemes -- Prime Normal Form and Equivalence of Simple Grammars -- An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata -- Finite Automata and Unions of Regular Patterns with Bounded Constant Segments -- Inside Vaucanson -- Deterministic Recognition of Trees Accepted by a Linear Pushdown Tree Automaton -- Shorter Regular Expressions from Finite-State Automata -- Wind in the Willows – Generating Music by Means of Tree Transducers -- On Deterministic Catalytic Systems -- Restricting the Use of Auxiliary Symbols for Restarting Automata -- A Class of Rational "]
[{"$nulls":4},"n-WFSM Auto-intersections -- Experiments with Deterministic ?-Automata for Formulas of Linear Temporal Logic -- Computing Affine Hulls over and from Sets Represented by Number Decision Diagrams -- Tree Automata and XPath on Compressed Trees -- Deeper Connections Between LTL and Alternating Automata -- The Structure of Subword Graphs and Suffix Trees of Fibonacci Words -- Observations on Determinization of Büchi Automata -- The Interval Rank of Monotonic Automata -- Compressing XML Documents Using Recursive Finite State Automata -- Non-backtracking Top-Down Algorithm for Checking Tree Automata Containment -- Size Reduction of Multitape Automata -- Robust Spelling Correction -- On Two-Dimensional Pattern Matching by Finite Automata -- Poster Abstracts -- Incremental and Semi-incremental Construction of Pseudo-Minimal Automata -- Is Learning RFSAs Better Than Learning DFAs? -- Learning Stochastic Finite Automata for Musical Style Recognition -- Simulation of Soliton Circuits -- Acyclic Automata with Easy-to-Find Short Regular Expressions -- On the Equivalence Problem for Programs with Mode Switching -- Automata and AB-Categorial Grammars -- On a Class of Bijective Binary Transducers with Finitary Description Despite Infinite State Set."]
[null,"2.","Record Nr.",null,"UNISALENTO991001825569707536"]
[null,null,"Autore",null,"Fiorentini, Fausto"]
[null,null,"Titolo",null,"Trasporti e territorio : nodi e prospettive in Italia / Fausto Fiorentini, Giampaolo Russo"]
[null,null,"Pubbl/distr/stampa",null,"Milano : Franco Angeli, 1979"]
[null,null,"Edizione",null,"[2. ed.]"]
[null,null,"Descrizione fisica",null,"163 p. ; 22 cm"]
[null,null,"Collana",null,"ISPE"]
[null,null,"Disciplina",null,"388"]
[null,null,"Soggetti",null,"Trasporti - Italia"]
[null,null,"Lingua di pubblicazione",null,"Italiano"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]