Cargando…
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor Corporativo: | |
| Otros Autores: | , |
| Formato: | Electrónico Congresos, conferencias eBook |
| Idioma: | Inglés |
| Publicado: |
Singapore ; New Jersey :
World Scientific,
©2005.
|
| Temas: | |
| Acceso en línea: | Texto completo |
Tabla de Contenidos:
- 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$