{"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":20,"n_cols":5,"rows_kept":20,"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],[6,2,6,3],[7,2,7,3],[8,2,8,3],[10,2,10,3],[11,2,11,3],[15,2,15,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910783915703321"]
[null,null,"Titolo",null,"The mathematical foundation of informatics [[electronic resource] ] : proceedings of the conference, Hanoi, Vietnam, 25-28 October 1999 / / editors, Do Long Van, M. Ito"]
[null,null,"Pubbl/distr/stampa",null,"Singapore ; ; New Jersey, : World Scientific, c2005"]
[null,null,"ISBN",null,"1-281-37286-2"]
[{"$nulls":4},"9786611372866"]
[{"$nulls":4},"981-270-311-X"]
[null,null,"Descrizione fisica",null,"1 online resource (215 p.)"]
[null,null,"Disciplina",null,"004.01/51"]
[null,null,"Soggetti",null,"Information technology - Mathematics"]
[{"$nulls":4},"Information science - Mathematics"]
[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","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references."]
[null,null,"Nota di contenuto",null,"Preface; Contents; On Growth Function of Petri Net and its Applications Pham Tra An; On an Infinite Hierarchy of Petri Net Languages Pham Tra A n and Pham Van Thao; Algorithms to Test Rational w-Codes Xavier Augros and Igor Litovsky; Distributed Random Walks for an Efficient Design of a Random Spanning Tree Hichem Baala and Marc Bui; Formal Concept Analysis and Rough Set Theory in Clustering Ho Tu Bao; A Simple Heuristic Method for the Min-Cut k-Balanced Partitioning Problem Lelia Blin and Ivan Lavallee; Longest Cycles and Restgraph in Maximal Non-Hamiltonian Graphs Vu Dinh Hoa"]
[{"$nulls":4},"Deterministic and Nondeterministic Directable Automata Masami ItoWorst-Case Redundancy of Solid Codes Helmut Jiirgensen and Stavros Konstantinidis; Maximal Independent Sets in Certain Subword Orders Nguyen Huong Lam; Strong Recognition of Rational w-Languages Bertrand Le Saec, V. R. Dare and R. Siromoney; Some Results Concerning Covers in the Class of Multivalued Positive Boolean Dependencies Le Duc Minh, Vu Ngoc Loan and Nguyen Xuan Huy; A New Measure for Attribute Selection Do Tan Phong, Ho Thuan and Ha Quang Thuy"]
[{"$nulls":4},"The Complexity of Problems Defined by Boolean Circuits Steffen Reith and Klaus W. WagnerThe Rational Skimming Theorem Jacques Sakarovitch; A New Classification of Finite Simple Groups Wujie Shi and Seymour Lapschutz; Connectedness of Tetravalent Metacirculant "]
[{"$nulls":4},"Graphs with Non-Empty First Symbol Ngo Dac Tan and Tran Minh Tuoc; On the Relation between Maximum Entropy Principle and the Condition Independence Assumption in the Probabilistic Logic Ha Dang Cao Tung"]
[null,null,null,"Sommario/riassunto","This volume presents research results ranging from those in pure mathematical theory (semigroup theory, graph theory, etc.) to those in theoretical and applied computer science, e.g. formal languages, automata, codes, parallel and distributed computing, formal systems, knowledge systems and database theory."]