Combinatorics, Computability and Logic

The third Discrete Mathematics and Theoretical Computer Science conference (DMTCS'OI) of the Centre for Discrete Mathematics and Theoretical Computer Science of the University of Auckland has been organised at the Faculty of Math ematics and Computer Science, "Ovidius" University, Constan~a, Romania, with the co-operation of the Maritime Academy "Mircea eel Batran", Constan~a. It was held held in the beautiful Romanian city of Constan~a on the Black Sea. The conference was dedicated to Professor Frank Harary on the occasion of his 80th Birthday. The four invited speakers of the conference were: F. Harary (New Mexico State University, USA), H. Ishihara (Jaist, Japan), P. Odifreddi (Thrin Univer sity, Italy), 1. Tomescu (Bucharest University, Romania). The Programme Committee consisting of C.S. Calude (Chair, Auckland), C. Ding (Hong Kong), M.J. Dinneen (Secretary, Auckland), M.R. Fellows (Victo ria, Canada), M. Hallett (Zurich), M. Ito (Kyoto), S. Istrail (Rockville, USA), K-W. Lih (Taipei), S. Marcus (Bucharest), Y. Matiyasevich (St. Petersburg), Gh. Paun (Bucharest), S. Rudeanu (Bucharest), J. Rutten (Amsterdam), K.

Klappentext

This volume contains the papers presented at the Third Discrete Mathematics and Theoretical Computer Science Conference (DMTCS1), which was held at 'Ovidius'University Constantza, Romania in July 2001. The conference was open to all areas of discrete mathematics and theoretical computer science, and the papers contained within this volume cover topics such as: abstract data types and specifications; algorithms and data structures; automata and formal languages; computability, complexity and constructive mathematics; discrete mathematics, combinatorial computing and category theory; logic, nonmonotonic logic and hybrid systems; molecular computing.

Zusammenfassung
This volume contains the papers presented at the Third Combinatorics, Computability and Logic (DMTCS'01) conference, These papers cover topics such as abstract data types and specifications algorithms and data structures automata and formal languages computability among others.

Inhalt
Invited papers.- Early Computer Science Adventures of a Mathematician.- Sequentially Continuity in Constructive Mathematics.- Recursive Functions: An Archeological Look.- The Number of Graphs and Digraphs with a Fixed Diameter and Connectivity.- Contributed papers.- Some Results for Some Conjectures in Addition Chains.- A Highly Random Number.- Dini's Theorem: A Constructive Case Study.- Even Linear Simple Matrix Languages: Formal Language Aspects.- Pseudo-BCK Algebras: An Extension of BCK Algebras.- P-Immune Sets with Holes Lack Self-Reducibility Properties.- Lex Ideals of Generalized MV-Algebras.- Armstrong Systems on Ordered Sets.- Unicycle Bipartite Graphs with Only Uniquely Restricted Maximum Matchings.- On Relax-ability of Word-Order by D-grammars.- On the Structure of Linear Cellular Automata.- Monotonically Computable Real Numbers.- Apartness as a Relation Between Subsets.- How Large is the Set of Disjunctive Sequences?.- A Loopless Generation of Bitstrings without p Consecutive Ones.- Greedy Algorithms for the Lower and Upper Chromatic Numbers.