LEADER 03747nam  22006014a 450 
001 9910783915703321
005 20230124182118.0
010   $a1-281-37286-2
010   $a9786611372866
010   $a981-270-311-X
035   $a(CKB)1000000000334434
035   $a(EBL)296166
035   $a(OCoLC)476063822
035   $a(SSID)ssj0000199083
035   $a(PQKBManifestationID)11169243
035   $a(PQKBTitleCode)TC0000199083
035   $a(PQKBWorkID)10184458
035   $a(PQKB)11558384
035   $a(MiAaPQ)EBC296166
035   $a(WSP)00000799    
035   $a(Au-PeEL)EBL296166
035   $a(CaPaEBR)ebr10174049
035   $a(EXLCZ)991000000000334434
100   $a20060926d2005      uy             0
101 0 $aeng
135   $aur|n|---|||||
181   $ctxt
182   $cc
183   $acr
200 14$aThe mathematical foundation of informatics$b[electronic resource] $eproceedings of the conference, Hanoi, Vietnam, 25-28 October 1999 /$feditors, Do Long Van, M. Ito
210   $aSingapore ;$aNew Jersey $cWorld Scientific$dc2005
215   $a1 online resource (215 p.)
300   $aDescription based upon print version of record.
311   $a981-02-4656-0 
320   $aIncludes bibliographical references.
327   $aPreface; 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
327   $aDeterministic 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
327   $aThe 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 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
330   $aThis 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.
606   $aInformation technology$xMathematics$vCongresses
606   $aInformation science$xMathematics$vCongresses
615  0$aInformation technology$xMathematics
615  0$aInformation science$xMathematics
676   $a004.01/51
701   $aDo$b Long Van$f1941-$01507895
701   $aIto?$b Masami$f1941-$0278611
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910783915703321
996   $aThe mathematical foundation of informatics$93738929
997   $aUNINA