THE MATHEMATICAL FOUNDATION OF INFORMATICS
|
|
THE MATHEMATICAL FOUNDATION OF INFORMATICS
Proceedings of the Conference
Hanoi, Vietnam 25 - 28 October 1999
edited by Do Long Van (Institute of Mathematics, Vietnam) & M Ito (Kyoto Sangyo University, Japan)
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.
Contents:
- On an Infinite Hierarchy of Petri Net Languages (P T An & P V Thao)
-
Algorithms to Test Rational w-Codes (X Augros & I Litovsky)
- Longest Cycles and Restgraph in Maximal Non-Hamiltonian Graphs (V D Hoa)
- Deterministic and Nondeterministic Directable Automata (M Ito)
- Worst-Case Redundancy of Solid Codes (H J�rgensen & S Konstantinidis)
- Maximal Independent Sets in Certain Subword Orders (N H Lam)
- Strong Recognition of Rational w-Languages (B L Sa�c et al.)
- Some Results Concerning Covers in the Class of Multivalued Positive Boolean Dependencies (L D Minh et al.)
- The Complexity of Problems Defined by Boolean Circuits (S Reith & K W Wagner)
- The Rational Skimming Theorem (J Sakarovitch)
- A New Classification of Finite Simple Groups (W Shi & S Lipschutz)
- Connectedness of Tetravalent Metacirculant Graphs with Non-Empty First Symbol (N D Tan & T M Tuoc)
- and other papers
View Full Text (9,545 KB)
Readership: Researchers on the theoretical foundations of computer
science and related fields.
|
| |
212pp
Pub. date: Nov 2005
eISBN 981-270-311-X
Price: US$107
|
|
| |
| |
|
|
|
|
|
|
