The mathematical foundation of informatics. Proceedings of the conference, Hanoi, Vietnam, October 25--28, 1999 (Q2713668)

The book is a collection of 18 articles representing some of the invited lectures and accepted submissions at The Mathematical Foundation of Informatics Conference, Hanoi, Vietnam, October 25--28, 1999. The following is the list of papers classified into three categories. Formal languages and word combinatorics: Pham Tra An, ``On growth function of Petri net and its applications'', Pham Tra An and Pham Van Thao, ``On an infinite hierarchy of Petri net languages'', Xavier Augros and Igor Litovsky, ``Algorithms to test rational \(\omega\)-codes'', Masami Ito, ``Deterministic and nondeterministic directable automata'', Helmut Jürgensen and Stavros Konstantinidis, ``Worst-case redundancy of solid codes'', Nguyen Huong Lam, ``Maximal independent sets in certain subword orders'', Bertrand Le Saec, V. R. Dare, and R. Siromoney, ``Strong recognition of rational \(\omega\)-languages'', Jacques Sakarovitch, ``The rational skimming theorem''. Combinatorial algorithms: Hichem Baala and Marc Bui, ``Distributed random walks for an efficient design of a random spanning tree'', Lelia Blin and Ivan Lavallee, ``A simple heuristic method for the min-cut \(k\)-balanced partitioning problem'', Vu Dinh Hoa, ``Longest cycles and restgraph in maximal non-Hamiltonian graphs''. Other: Ho Tu Bao, ``Formal concept analysis and rough set theory in clustering'', Le Duc Minh, Vu Ngoc Loan and Nguyen Xuan Huy, ``Some results concerning covers in the class of multivalued positive Boolean dependencies'', Do Tan Phong, Ho Thuan and Ha Quang Thuy, ``A new measure for attribute selection'', Steffen Reith and Klaus W. Wagner, ``The complexity of problems defined by Boolean circuits'', Wujie Shi and Seymour Lipschutz, ``A new classification of finite simple groups'', Ngo Dac Tan and Tran Minh Tuoc, ``Connectedness of tetravalent metacirculant graphs with non-empty first symbol'', Ha Dang Cao Tung, ``On the relation between maximum entropy principle and the condition independence assumption in the probabilistic logic''.