|
|
|
|
LEADER |
00000cam a2200000 a 4500 |
001 |
EBSCO_ocn182530765 |
003 |
OCoLC |
005 |
20231017213018.0 |
006 |
m o d |
007 |
cr cn||||||||| |
008 |
060926s2005 si a ob 100 0 eng d |
010 |
|
|
|z 2006299137
|
040 |
|
|
|a COCUF
|b eng
|e pn
|c COCUF
|d OCLCG
|d OCLCQ
|d N$T
|d YDXCP
|d OCLCE
|d IDEBK
|d OCLCQ
|d DKDLA
|d LYU
|d E7B
|d OCLCQ
|d FVL
|d OCLCQ
|d OCLCO
|d OCLCQ
|d AZK
|d AGLDB
|d MOR
|d PIFBR
|d OCLCQ
|d U3W
|d OCLCF
|d STF
|d WRM
|d VTS
|d OCLCQ
|d INT
|d VT2
|d OCLCQ
|d AU@
|d LEAUB
|d CEF
|d UX1
|d OCLCQ
|d K6U
|d UKCRE
|d OCLCQ
|d OCLCO
|d M8D
|d OCLCO
|d OCLCQ
|d INARC
|d OCLCO
|
019 |
|
|
|a 77501501
|a 482677397
|a 626042470
|a 632683829
|a 648233664
|a 658929027
|a 680236329
|a 722568523
|a 728037806
|a 748527897
|a 756542043
|a 815570800
|a 961581989
|a 962620504
|a 974134830
|a 974437206
|a 974507448
|a 974573215
|a 982317774
|a 988441529
|a 991991703
|a 1018046548
|a 1037754830
|a 1038631920
|a 1043019077
|a 1047941323
|a 1055254721
|a 1055346875
|a 1081188342
|a 1086437686
|a 1096454294
|a 1101721691
|a 1153523885
|a 1228549271
|a 1359008166
|
020 |
|
|
|a 9810246560
|
020 |
|
|
|a 9789810246563
|
020 |
|
|
|a 981270311X
|q (electronic bk.)
|
020 |
|
|
|a 9789812703118
|q (electronic bk.)
|
020 |
|
|
|a 1281372862
|
020 |
|
|
|a 9781281372864
|
029 |
1 |
|
|a DEBBG
|b BV043110376
|
029 |
1 |
|
|a DEBSZ
|b 422239097
|
029 |
1 |
|
|a GBVCP
|b 802388787
|
029 |
1 |
|
|a NZ1
|b 12061885
|
029 |
1 |
|
|a YDXCP
|b 2501764
|
035 |
|
|
|a (OCoLC)182530765
|z (OCoLC)77501501
|z (OCoLC)482677397
|z (OCoLC)626042470
|z (OCoLC)632683829
|z (OCoLC)648233664
|z (OCoLC)658929027
|z (OCoLC)680236329
|z (OCoLC)722568523
|z (OCoLC)728037806
|z (OCoLC)748527897
|z (OCoLC)756542043
|z (OCoLC)815570800
|z (OCoLC)961581989
|z (OCoLC)962620504
|z (OCoLC)974134830
|z (OCoLC)974437206
|z (OCoLC)974507448
|z (OCoLC)974573215
|z (OCoLC)982317774
|z (OCoLC)988441529
|z (OCoLC)991991703
|z (OCoLC)1018046548
|z (OCoLC)1037754830
|z (OCoLC)1038631920
|z (OCoLC)1043019077
|z (OCoLC)1047941323
|z (OCoLC)1055254721
|z (OCoLC)1055346875
|z (OCoLC)1081188342
|z (OCoLC)1086437686
|z (OCoLC)1096454294
|z (OCoLC)1101721691
|z (OCoLC)1153523885
|z (OCoLC)1228549271
|z (OCoLC)1359008166
|
042 |
|
|
|a dlr
|
050 |
|
4 |
|a T58.5
|b .M385 1999eb
|
072 |
|
7 |
|a COM
|x 052000
|2 bisacsh
|
072 |
|
7 |
|a COM
|x 037000
|2 bisacsh
|
072 |
|
7 |
|a COM
|x 013000
|2 bisacsh
|
072 |
|
7 |
|a COM
|x 032000
|2 bisacsh
|
072 |
|
7 |
|a COM
|x 018000
|2 bisacsh
|
072 |
|
7 |
|a COM
|x 014000
|2 bisacsh
|
072 |
|
7 |
|a COM
|x 067000
|2 bisacsh
|
072 |
|
7 |
|a UYA
|2 bicssc
|
082 |
0 |
4 |
|a 004.01/51
|2 22
|
049 |
|
|
|a UAMI
|
111 |
2 |
|
|a Mathematical Foundation of Informatics
|d (1999 :
|c Hanoi, Vietnam)
|
245 |
1 |
4 |
|a The mathematical foundation of informatics :
|b proceedings of the conference, Hanoi, Vietnam, 25-28 October 1999 /
|c editors, Do Long Van, M. Ito.
|
260 |
|
|
|a Singapore ;
|a New Jersey :
|b World Scientific,
|c ©2005.
|
300 |
|
|
|a 1 online resource (x, 202 pages) :
|b illustrations
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a data file
|
504 |
|
|
|a Includes bibliographical references.
|
505 |
0 |
|
|a Cover -- Contents -- Preface -- On Growth Function of Petri Net and its Applications -- 1 Introduction -- 2 Definitions -- 3 The Growth Function of a Petri Net -- 4 The Growth Function and Representative Complexity -- 5 Remark and Open Problem -- Acknowledgement. -- References -- On an Infinite Hierarchy of Petri Net Languages -- 1 Preliminaries -- 2 On a criterion for Petri net languages -- 3 An infinite hierarchy of Petri net languages -- Acknowledgment -- References -- Algorithms to Test Rational w-Codes -- 1 Introduction -- 2 Preliminaries -- 3 Testing unique decipherability of finite words -- 3.1 The Test of Sardinas and Patterson -- 3.2 A Test by product of automata -- 4 Testing rational w-codes -- 4.1 A Test by product of automata -- 4.2 A Test for strict-codes -- 4.3 Another test for Codes and w-Codes -- Rational case -- 5 Complexity analysis -- Test by interlaced product -- Tests by quotients of languages -- Acknowledgments -- References -- Distributed Random Walks for an Efficient Design of a Random Spanning Tree -- 1 Introduction -- 2 Preliminaries -- 3 Algorithms description -- 4 Correctness and complexity proofs -- 5 Conclusions and future works -- References -- Formal Concept Analysis and Rough Set Theory in Clustering -- 1 Formal Concept Analysis and Rough Set Theory -- 2 FCA-based Conceptual Clustering -- 3 Approximate Conceptual Clustering -- 4 Document Clustering based on a Tolerance Rough Set Model -- References -- A Simple Heuristic Method for the Min-Cut k-Balanced Partitioning Problem -- 1 Introduction -- 2 The problem -- 3 The state of the art -- 3.1 Bi-Partitioning: MC2P -- 3.2 Min-Cut Balanced Bi-Partioning: MCB2P -- 3.3 Hypergraph -- 3.4 Geometric Representation -- 3.5 Replication -- 4 Our heuristic -- 4.1 Example -- References -- Longest Cycles and Restgraph in Maximal Non-Hamiltonian Graphs -- 1 Terminology and Notation -- 2 Results and Conjecture -- References -- Deterministic and Nondeterministic Directable Automata -- 1 Introduction -- 2 Deterministic Directable Automata -- 3 Nondeterministic Directable Automata -- 4 Commutative Nondeterministic Directable Automata -- Acknowledgement -- References -- Worst-Case Redundancy of Solid Codes -- 1 Introduction -- 2 Notions and Notation -- 3 Maximal Solid Codes in a+b+ U a+b+a+b+ -- 4 Properties of Near-Inverses -- 5 Redundancy of Maximal Solid Codes in a+b+ U a+b+a+b+ -- 6 Concluding Remarks -- References -- Maximal Independent Sets in Certain Subword Orders -- 1 Introduction -- 2 Maximal independent sets in length-compatible order -- 3 Factor order. Infix codes -- 4 Subword order. Hypercodes -- References -- Strong Recognition of Rational w-Languages -- 1 Introduction -- 2 Preliminaries -- 3 Strong congruence recognition -- 4 Mac Naughton Theorem and strong recognition -- 4.1 Nice semigroups -- 4.2 Semigroups with commutative stabilizers -- References -- Some Results Concerning Covers in the Class of Multivalued Positive Boolean Dependencies -- 1. Introduction -- 2. Some concepts and results -- Algorithm MEMBER -- Algorithm DERIVES -- Algorithm EQUIVALENCE -- Algorithm REDUNDANT -- Algorithm NONREDUN -- Acknowledgments -- T$
|
520 |
|
|
|a 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.
|
588 |
0 |
|
|a Print version record.
|
506 |
|
|
|3 Use copy
|f Restrictions unspecified
|2 star
|5 MiAaHDL
|
533 |
|
|
|a Electronic reproduction.
|b [Place of publication not identified] :
|c HathiTrust Digital Library,
|d 2010.
|5 MiAaHDL
|
538 |
|
|
|a Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
|u http://purl.oclc.org/DLF/benchrepro0212
|5 MiAaHDL
|
583 |
1 |
|
|a digitized
|c 2010
|h HathiTrust Digital Library
|l committed to preserve
|2 pda
|5 MiAaHDL
|
590 |
|
|
|a eBooks on EBSCOhost
|b EBSCO eBook Subscription Academic Collection - Worldwide
|
650 |
|
0 |
|a Information technology
|x Mathematics
|v Congresses.
|
650 |
|
0 |
|a Information science
|x Mathematics
|v Congresses.
|
650 |
|
6 |
|a Technologie de l'information
|x Mathématiques
|v Congrès.
|
650 |
|
6 |
|a Sciences de l'information
|x Mathématiques
|v Congrès.
|
650 |
|
7 |
|a COMPUTERS
|x Reference.
|2 bisacsh
|
650 |
|
7 |
|a COMPUTERS
|x Machine Theory.
|2 bisacsh
|
650 |
|
7 |
|a COMPUTERS
|x Computer Literacy.
|2 bisacsh
|
650 |
|
7 |
|a COMPUTERS
|x Information Technology.
|2 bisacsh
|
650 |
|
7 |
|a COMPUTERS
|x Data Processing.
|2 bisacsh
|
650 |
|
7 |
|a COMPUTERS
|x Computer Science.
|2 bisacsh
|
650 |
|
7 |
|a COMPUTERS
|x Hardware
|x General.
|2 bisacsh
|
655 |
|
7 |
|a Conference papers and proceedings
|2 fast
|
700 |
1 |
|
|a Do, Long Van,
|d 1941-
|
700 |
1 |
|
|a Itō, Masami,
|d 1941-
|
776 |
0 |
8 |
|i Print version:
|a Mathematical Foundation of Informatics (1999 : Hanoi, Vietnam).
|t Mathematical foundation of informatics.
|d Singapore ; New Jersey : World Scientific, ©2005
|w (DLC) 2006299137
|
856 |
4 |
0 |
|u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=174633
|z Texto completo
|
936 |
|
|
|a BATCHLOAD
|
938 |
|
|
|a ebrary
|b EBRY
|n ebr10174049
|
938 |
|
|
|a EBSCOhost
|b EBSC
|n 174633
|
938 |
|
|
|a ProQuest MyiLibrary Digital eBook Collection
|b IDEB
|n 137286
|
938 |
|
|
|a YBP Library Services
|b YANK
|n 2501764
|
938 |
|
|
|a Internet Archive
|b INAR
|n mathematicalfoun0000math
|
994 |
|
|
|a 92
|b IZTAP
|