{"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":25,"n_cols":5,"rows_kept":25,"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],[17,2,17,3],[18,2,18,3],[22,2,22,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910143894303321"]
[null,null,"Titolo",null,"Developments in Language Theory : 6th International Conference, DLT 2002, Kyoto, Japan, September 18-21, 2002, Revised Papers / / edited by Masami Ito, Masafumi Toyama"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003"]
[null,null,"ISBN",null,"3-540-45005-X"]
[null,null,"Edizione",null,"[1st ed. 2003.]"]
[null,null,"Descrizione fisica",null,"1 online resource (X, 438 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 2450"]
[null,null,"Disciplina",null,"511.3"]
[null,null,"Soggetti",null,"Logic, Symbolic and mathematical"]
[{"$nulls":4},"Computers"]
[{"$nulls":4},"Computer logic"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Mathematical Logic and Formal Languages"]
[{"$nulls":4},"Science, Humanities and Social Sciences, multidisciplinary"]
[{"$nulls":4},"Computation by Abstract Devices"]
[{"$nulls":4},"Logics and Meanings of Programs"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[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 Presentations -- Computational Processes in Living Cells: Gene Assembly in Ciliates -- Experimental Quantum Computation with Molecules -- Efficient Transformations from Regular Expressions to Finite Automata -- Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators -- A Remark about Quadratic Trace Equations -- Infinite Snake Tiling Problems -- Decision Problems for Linear and Circular Splicing Systems -- Finite Automata Models of Quantized Systems: Conceptual Status and Outlook -- Automata on Linear Orderings -- Contributions -- Some Properties of Ciliate Bio-operations -- On the Descriptional Complexity of Some Variants of Lindenmayer Systems -- Carriers and Counters -- On the Separation between k-Party and (k - 1)-Party Nondeterministic Message Complexities -- Unary Language Operations and Their Nondeterministic State Complexity -- Constructing Infinite Words of Intermediate Complexity -- A Space Lower Bound of Two-Dimensional Probabilistic Turing Machines -- Undecidability of Weak Bisimilarity for "]
[{"$nulls":4},"PA-Processes -- Improved Bounds on the Number of Automata Accepting Finite Languages -- Roots and Powers of Regular Languages -- Innermost Termination of Context-Sensitive Rewriting -- A Unique Structure of Two-Generated Binary Equality Sets -- On Deterministic Finite Automata and Syntactic Monoid Size -- An Inverse Automata Algorithm for Recognizing 2-Collapsing Words -- Efficient Algorithm for Checking Multiplicity Equivalence for the Finite Z - ?*-Automata -- Some Remarks on Asynchronous Automata -- Tiling Systems over Infinite Pictures and Their Acceptance Conditions -- The Average Lengths of the Factors of the Standard Factorization of Lyndon Words -- Circular Words Avoiding Patterns -- Safety Verification for Two-Way Finite Automata with Monotonic Counters -- An Infinite Prime Sequence Can Be Generated in Real-Time by a 1-Bit Inter-cell Communication Cellular Automaton -- On the Structure of Graphic DLI-Sets -- Finite Completion of Comma-Free Codes. Part I -- On a Family of Codes with Bounded Deciphering Delay -- Abstract Families of Graphs -- Automaton Representation of Linear Conjunctive Languages -- On-Line Odometers for Two-Sided Symbolic Dynamical Systems -- Characteristic Semigroups of Directable Automata."]
[null,null,null,"Sommario/riassunto","The refereed proceedings of the 6th International Conference on Developments in Language Theory, DLT 2002, held in Kyoto, Japan in September 2002. The 28 revised full papers presented together with 8 invited papers were carefully reviewed and selected from 63 submissions. Among the topics addressed are grammars and acceptors for strings, graphs, arrays, etc; efficient algorithms for languages; combinatorial and algebraic properties of languages; decision problems; relations to complexity theory, logic picture description and analysis, DNA computing, cryptography, concurrency, quantum computing, and algebraic systems."]