The mathematical foundation of informatics :: proceedings of the conference, Hanoi, Vietnam, 25-28 October 1999 /
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...
Gespeichert in:
| Körperschaft: | |
|---|---|
| Weitere Verfasser: | , |
| Format: | Elektronisch Tagungsbericht E-Book |
| Sprache: | English |
| Veröffentlicht: |
Singapore ; New Jersey :
World Scientific,
©2005.
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | 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. |
| Beschreibung: | 1 online resource (x, 202 pages) : illustrations |
| Format: | 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. |
| Bibliographie: | Includes bibliographical references. |
| ISBN: | 9810246560 9789810246563 981270311X 9789812703118 1281372862 9781281372864 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn182530765 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.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 |d OCLCL | ||
| 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 |a 1409017154 | ||
| 020 | |a 9810246560 | ||
| 020 | |a 9789810246563 | ||
| 020 | |a 981270311X |q (electronic bk.) | ||
| 020 | |a 9789812703118 |q (electronic bk.) | ||
| 020 | |a 1281372862 | ||
| 020 | |a 9781281372864 | ||
| 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 |z (OCoLC)1409017154 | ||
| 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 | 7 | |a 004.01/51 |2 22 | |
| 049 | |a MAIN | ||
| 111 | 2 | |a Mathematical Foundation of Informatics |d (1999 : |c Hanoi, Vietnam) |0 http://id.loc.gov/authorities/names/no2006029554 | |
| 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 | |
| 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- |1 https://id.oclc.org/worldcat/entity/E39PCjM9r8W8vpfbCKkyhy43pK |0 http://id.loc.gov/authorities/names/no2006029519 | |
| 700 | 1 | |a Itō, Masami, |d 1941- |1 https://id.oclc.org/worldcat/entity/E39PCjJydKqf9WmQ4yMPmMbxfy |0 http://id.loc.gov/authorities/names/nr91041708 | |
| 758 | |i has work: |a The mathematical foundation of informatics (Text) |1 https://id.oclc.org/worldcat/entity/E39PCGBRMq9fmTYrYmbVjfJRrq |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 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 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=174633 |3 Volltext |
| 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 GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn182530765 |
|---|---|
| _version_ | 1816881657859276800 |
| adam_text | |
| any_adam_object | |
| author2 | Do, Long Van, 1941- Itō, Masami, 1941- |
| author2_role | |
| author2_variant | l v d lv lvd m i mi |
| author_GND | http://id.loc.gov/authorities/names/no2006029519 http://id.loc.gov/authorities/names/nr91041708 |
| author_corporate | Mathematical Foundation of Informatics Hanoi, Vietnam |
| author_corporate_role | |
| author_facet | Do, Long Van, 1941- Itō, Masami, 1941- Mathematical Foundation of Informatics Hanoi, Vietnam |
| author_sort | Mathematical Foundation of Informatics Hanoi, Vietnam |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | T - Technology |
| callnumber-label | T58 |
| callnumber-raw | T58.5 .M385 1999eb |
| callnumber-search | T58.5 .M385 1999eb |
| callnumber-sort | T 258.5 M385 41999EB |
| callnumber-subject | T - General Technology |
| collection | ZDB-4-EBA |
| contents | 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$ |
| ctrlnum | (OCoLC)182530765 |
| dewey-full | 004.01/51 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.01/51 |
| dewey-search | 004.01/51 |
| dewey-sort | 14.01 251 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Electronic Conference Proceeding eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>08802cam a2200841 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn182530765</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cn|||||||||</controlfield><controlfield tag="008">060926s2005 si a ob 100 0 eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="z"> 2006299137</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">COCUF</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">COCUF</subfield><subfield code="d">OCLCG</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">N$T</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLCE</subfield><subfield code="d">IDEBK</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">DKDLA</subfield><subfield code="d">LYU</subfield><subfield code="d">E7B</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">FVL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AZK</subfield><subfield code="d">AGLDB</subfield><subfield code="d">MOR</subfield><subfield code="d">PIFBR</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">U3W</subfield><subfield code="d">OCLCF</subfield><subfield code="d">STF</subfield><subfield code="d">WRM</subfield><subfield code="d">VTS</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">INT</subfield><subfield code="d">VT2</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AU@</subfield><subfield code="d">LEAUB</subfield><subfield code="d">CEF</subfield><subfield code="d">UX1</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">K6U</subfield><subfield code="d">UKCRE</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">M8D</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">INARC</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">77501501</subfield><subfield code="a">482677397</subfield><subfield code="a">626042470</subfield><subfield code="a">632683829</subfield><subfield code="a">648233664</subfield><subfield code="a">658929027</subfield><subfield code="a">680236329</subfield><subfield code="a">722568523</subfield><subfield code="a">728037806</subfield><subfield code="a">748527897</subfield><subfield code="a">756542043</subfield><subfield code="a">815570800</subfield><subfield code="a">961581989</subfield><subfield code="a">962620504</subfield><subfield code="a">974134830</subfield><subfield code="a">974437206</subfield><subfield code="a">974507448</subfield><subfield code="a">974573215</subfield><subfield code="a">982317774</subfield><subfield code="a">988441529</subfield><subfield code="a">991991703</subfield><subfield code="a">1018046548</subfield><subfield code="a">1037754830</subfield><subfield code="a">1038631920</subfield><subfield code="a">1043019077</subfield><subfield code="a">1047941323</subfield><subfield code="a">1055254721</subfield><subfield code="a">1055346875</subfield><subfield code="a">1081188342</subfield><subfield code="a">1086437686</subfield><subfield code="a">1096454294</subfield><subfield code="a">1101721691</subfield><subfield code="a">1153523885</subfield><subfield code="a">1228549271</subfield><subfield code="a">1359008166</subfield><subfield code="a">1409017154</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9810246560</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789810246563</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">981270311X</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789812703118</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1281372862</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781281372864</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)182530765</subfield><subfield code="z">(OCoLC)77501501</subfield><subfield code="z">(OCoLC)482677397</subfield><subfield code="z">(OCoLC)626042470</subfield><subfield code="z">(OCoLC)632683829</subfield><subfield code="z">(OCoLC)648233664</subfield><subfield code="z">(OCoLC)658929027</subfield><subfield code="z">(OCoLC)680236329</subfield><subfield code="z">(OCoLC)722568523</subfield><subfield code="z">(OCoLC)728037806</subfield><subfield code="z">(OCoLC)748527897</subfield><subfield code="z">(OCoLC)756542043</subfield><subfield code="z">(OCoLC)815570800</subfield><subfield code="z">(OCoLC)961581989</subfield><subfield code="z">(OCoLC)962620504</subfield><subfield code="z">(OCoLC)974134830</subfield><subfield code="z">(OCoLC)974437206</subfield><subfield code="z">(OCoLC)974507448</subfield><subfield code="z">(OCoLC)974573215</subfield><subfield code="z">(OCoLC)982317774</subfield><subfield code="z">(OCoLC)988441529</subfield><subfield code="z">(OCoLC)991991703</subfield><subfield code="z">(OCoLC)1018046548</subfield><subfield code="z">(OCoLC)1037754830</subfield><subfield code="z">(OCoLC)1038631920</subfield><subfield code="z">(OCoLC)1043019077</subfield><subfield code="z">(OCoLC)1047941323</subfield><subfield code="z">(OCoLC)1055254721</subfield><subfield code="z">(OCoLC)1055346875</subfield><subfield code="z">(OCoLC)1081188342</subfield><subfield code="z">(OCoLC)1086437686</subfield><subfield code="z">(OCoLC)1096454294</subfield><subfield code="z">(OCoLC)1101721691</subfield><subfield code="z">(OCoLC)1153523885</subfield><subfield code="z">(OCoLC)1228549271</subfield><subfield code="z">(OCoLC)1359008166</subfield><subfield code="z">(OCoLC)1409017154</subfield></datafield><datafield tag="042" ind1=" " ind2=" "><subfield code="a">dlr</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">T58.5</subfield><subfield code="b">.M385 1999eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">052000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">037000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">013000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">032000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">018000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">014000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">067000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">UYA</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">004.01/51</subfield><subfield code="2">22</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">Mathematical Foundation of Informatics</subfield><subfield code="d">(1999 :</subfield><subfield code="c">Hanoi, Vietnam)</subfield><subfield code="0">http://id.loc.gov/authorities/names/no2006029554</subfield></datafield><datafield tag="245" ind1="1" ind2="4"><subfield code="a">The mathematical foundation of informatics :</subfield><subfield code="b">proceedings of the conference, Hanoi, Vietnam, 25-28 October 1999 /</subfield><subfield code="c">editors, Do Long Van, M. Ito.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Singapore ;</subfield><subfield code="a">New Jersey :</subfield><subfield code="b">World Scientific,</subfield><subfield code="c">©2005.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (x, 202 pages) :</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">data file</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="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$</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="506" ind1=" " ind2=" "><subfield code="3">Use copy</subfield><subfield code="f">Restrictions unspecified</subfield><subfield code="2">star</subfield><subfield code="5">MiAaHDL</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="a">Electronic reproduction.</subfield><subfield code="b">[Place of publication not identified] :</subfield><subfield code="c">HathiTrust Digital Library,</subfield><subfield code="d">2010.</subfield><subfield code="5">MiAaHDL</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="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.</subfield><subfield code="u">http://purl.oclc.org/DLF/benchrepro0212</subfield><subfield code="5">MiAaHDL</subfield></datafield><datafield tag="583" ind1="1" ind2=" "><subfield code="a">digitized</subfield><subfield code="c">2010</subfield><subfield code="h">HathiTrust Digital Library</subfield><subfield code="l">committed to preserve</subfield><subfield code="2">pda</subfield><subfield code="5">MiAaHDL</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Information technology</subfield><subfield code="x">Mathematics</subfield><subfield code="v">Congresses.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Information science</subfield><subfield code="x">Mathematics</subfield><subfield code="v">Congresses.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Technologie de l'information</subfield><subfield code="x">Mathématiques</subfield><subfield code="v">Congrès.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Sciences de l'information</subfield><subfield code="x">Mathématiques</subfield><subfield code="v">Congrès.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Reference.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Machine Theory.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Computer Literacy.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Information Technology.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Data Processing.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Computer Science.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Hardware</subfield><subfield code="x">General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="a">Conference papers and proceedings</subfield><subfield code="2">fast</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Do, Long Van,</subfield><subfield code="d">1941-</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCjM9r8W8vpfbCKkyhy43pK</subfield><subfield code="0">http://id.loc.gov/authorities/names/no2006029519</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Itō, Masami,</subfield><subfield code="d">1941-</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCjJydKqf9WmQ4yMPmMbxfy</subfield><subfield code="0">http://id.loc.gov/authorities/names/nr91041708</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">The mathematical foundation of informatics (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCGBRMq9fmTYrYmbVjfJRrq</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Mathematical Foundation of Informatics (1999 : Hanoi, Vietnam).</subfield><subfield code="t">Mathematical foundation of informatics.</subfield><subfield code="d">Singapore ; New Jersey : World Scientific, ©2005</subfield><subfield code="w">(DLC) 2006299137</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=174633</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="936" ind1=" " ind2=" "><subfield code="a">BATCHLOAD</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10174049</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">174633</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest MyiLibrary Digital eBook Collection</subfield><subfield code="b">IDEB</subfield><subfield code="n">137286</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">2501764</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Internet Archive</subfield><subfield code="b">INAR</subfield><subfield code="n">mathematicalfoun0000math</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| genre | Conference papers and proceedings fast |
| genre_facet | Conference papers and proceedings |
| id | ZDB-4-EBA-ocn182530765 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:16:12Z |
| institution | BVB |
| institution_GND | http://id.loc.gov/authorities/names/no2006029554 |
| isbn | 9810246560 9789810246563 981270311X 9789812703118 1281372862 9781281372864 |
| language | English |
| oclc_num | 182530765 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (x, 202 pages) : illustrations |
| psigel | ZDB-4-EBA |
| publishDate | 2005 |
| publishDateSearch | 2005 |
| publishDateSort | 2005 |
| publisher | World Scientific, |
| record_format | marc |
| spelling | Mathematical Foundation of Informatics (1999 : Hanoi, Vietnam) http://id.loc.gov/authorities/names/no2006029554 The mathematical foundation of informatics : proceedings of the conference, Hanoi, Vietnam, 25-28 October 1999 / editors, Do Long Van, M. Ito. Singapore ; New Jersey : World Scientific, ©2005. 1 online resource (x, 202 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier data file Includes bibliographical references. 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$ 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. Print version record. Use copy Restrictions unspecified star MiAaHDL Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2010. MiAaHDL 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. http://purl.oclc.org/DLF/benchrepro0212 MiAaHDL digitized 2010 HathiTrust Digital Library committed to preserve pda MiAaHDL Information technology Mathematics Congresses. Information science Mathematics Congresses. Technologie de l'information Mathématiques Congrès. Sciences de l'information Mathématiques Congrès. COMPUTERS Reference. bisacsh COMPUTERS Machine Theory. bisacsh COMPUTERS Computer Literacy. bisacsh COMPUTERS Information Technology. bisacsh COMPUTERS Data Processing. bisacsh COMPUTERS Computer Science. bisacsh COMPUTERS Hardware General. bisacsh Conference papers and proceedings fast Do, Long Van, 1941- https://id.oclc.org/worldcat/entity/E39PCjM9r8W8vpfbCKkyhy43pK http://id.loc.gov/authorities/names/no2006029519 Itō, Masami, 1941- https://id.oclc.org/worldcat/entity/E39PCjJydKqf9WmQ4yMPmMbxfy http://id.loc.gov/authorities/names/nr91041708 has work: The mathematical foundation of informatics (Text) https://id.oclc.org/worldcat/entity/E39PCGBRMq9fmTYrYmbVjfJRrq https://id.oclc.org/worldcat/ontology/hasWork Print version: Mathematical Foundation of Informatics (1999 : Hanoi, Vietnam). Mathematical foundation of informatics. Singapore ; New Jersey : World Scientific, ©2005 (DLC) 2006299137 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=174633 Volltext |
| spellingShingle | The mathematical foundation of informatics : proceedings of the conference, Hanoi, Vietnam, 25-28 October 1999 / 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$ Information technology Mathematics Congresses. Information science Mathematics Congresses. Technologie de l'information Mathématiques Congrès. Sciences de l'information Mathématiques Congrès. COMPUTERS Reference. bisacsh COMPUTERS Machine Theory. bisacsh COMPUTERS Computer Literacy. bisacsh COMPUTERS Information Technology. bisacsh COMPUTERS Data Processing. bisacsh COMPUTERS Computer Science. bisacsh COMPUTERS Hardware General. bisacsh |
| title | The mathematical foundation of informatics : proceedings of the conference, Hanoi, Vietnam, 25-28 October 1999 / |
| title_auth | The mathematical foundation of informatics : proceedings of the conference, Hanoi, Vietnam, 25-28 October 1999 / |
| title_exact_search | The mathematical foundation of informatics : proceedings of the conference, Hanoi, Vietnam, 25-28 October 1999 / |
| title_full | The mathematical foundation of informatics : proceedings of the conference, Hanoi, Vietnam, 25-28 October 1999 / editors, Do Long Van, M. Ito. |
| title_fullStr | The mathematical foundation of informatics : proceedings of the conference, Hanoi, Vietnam, 25-28 October 1999 / editors, Do Long Van, M. Ito. |
| title_full_unstemmed | The mathematical foundation of informatics : proceedings of the conference, Hanoi, Vietnam, 25-28 October 1999 / editors, Do Long Van, M. Ito. |
| title_short | The mathematical foundation of informatics : |
| title_sort | mathematical foundation of informatics proceedings of the conference hanoi vietnam 25 28 october 1999 |
| title_sub | proceedings of the conference, Hanoi, Vietnam, 25-28 October 1999 / |
| topic | Information technology Mathematics Congresses. Information science Mathematics Congresses. Technologie de l'information Mathématiques Congrès. Sciences de l'information Mathématiques Congrès. COMPUTERS Reference. bisacsh COMPUTERS Machine Theory. bisacsh COMPUTERS Computer Literacy. bisacsh COMPUTERS Information Technology. bisacsh COMPUTERS Data Processing. bisacsh COMPUTERS Computer Science. bisacsh COMPUTERS Hardware General. bisacsh |
| topic_facet | Information technology Mathematics Congresses. Information science Mathematics Congresses. Technologie de l'information Mathématiques Congrès. Sciences de l'information Mathématiques Congrès. COMPUTERS Reference. COMPUTERS Machine Theory. COMPUTERS Computer Literacy. COMPUTERS Information Technology. COMPUTERS Data Processing. COMPUTERS Computer Science. COMPUTERS Hardware General. Conference papers and proceedings |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=174633 |
| work_keys_str_mv | AT mathematicalfoundationofinformaticshanoivietnam themathematicalfoundationofinformaticsproceedingsoftheconferencehanoivietnam2528october1999 AT dolongvan themathematicalfoundationofinformaticsproceedingsoftheconferencehanoivietnam2528october1999 AT itomasami themathematicalfoundationofinformaticsproceedingsoftheconferencehanoivietnam2528october1999 AT mathematicalfoundationofinformaticshanoivietnam mathematicalfoundationofinformaticsproceedingsoftheconferencehanoivietnam2528october1999 AT dolongvan mathematicalfoundationofinformaticsproceedingsoftheconferencehanoivietnam2528october1999 AT itomasami mathematicalfoundationofinformaticsproceedingsoftheconferencehanoivietnam2528october1999 |