The Mathematical Foundation of Informatics

Contents
Preface
On Growth Function of Petri Net and its Applications
Pham 13-a An
On an Infinite Hierarchy of Petri Net Languages
Pham 13-a 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 Lavalle'e
Longest Cycles and Restgraph in Maximal Non-Hamiltonian Graphs
Vu Dinh Hoa
Deterministic and Nondeterministic Directable Automata
Masami It0
Worst-case Redundancy of Solid Codes
Helmut Jiirgensen and Stavros Konstantinidis
Maximal Independent Sets in Certain Subword Orders 95
Nguyen Huong Lam
Strong Recognition of Rational @-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
The Complexity of Problems Defined by Boolean Circuits
Steffen Reith and Klaus W. Wagner
The Rational Skimming Theorem
Jacques Sakarovitch
A New Classification of Finite Simple Groups
Wujie Shi and Seymour Lapschutz
Connectedness of Tetr avalent Met acir culant 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

Another The Core of CS Books
Download