+612 9045 4394
 
CHECKOUT
Combinatorics, Computability, and Logic : Proceedings of the Third International Conference on Combinatorics, Computability, and Logic, (DMTCS '01) : Discrete Mathematics and Theoretical Computer Science, - Cristina S. Calude

Combinatorics, Computability, and Logic : Proceedings of the Third International Conference on Combinatorics, Computability, and Logic, (DMTCS '01)

Discrete Mathematics and Theoretical Computer Science,

By: Cristina S. Calude (Editor), M. J. Dinneen (Editor), S. Sblurlan (Editor)

Paperback

Ships: 5 to 9 business days
5 to 9 business days
$158.39
or 4 easy payments of $39.60 with Learn more

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.

Early Computer Science Adventures of a Mathematicianp. 1
Sequentially Continuity in Constructive Mathematicsp. 5
Recursive Functions: An Archaeological Lookp. 13
The Number of Graphs and Digraphs with a Fixed Diameter and Connectivityp. 33
Some Results for Some Conjectures in Addition Chainsp. 47
A Highly Random Numberp. 55
Dini's Theorem: A Constructive Case Studyp. 69
Even Linear Simple Matrix Languages: Formal Language Aspectsp. 81
Pseudo-BCK Algebras: An Extension of BCK Algebrasp. 97
P-Immune Sets with Holes Lack Self-Reducibility Propertiesp. 115
Lex Ideals of Generalized MV-Algebrasp. 125
Armstrong Systems on Ordered Setsp. 137
Unicycle Bipartite Graphs with Only Uniquely Restricted Maximum Matchingsp. 151
On Relax-ability of Word-Order by D-grammarsp. 159
On the Structure of Linear Cellular Automatap. 175
Monotonically Computable Real Numbersp. 187
Apartness as a Relation Between Subsetsp. 203
How Large is the Set of Disjunctive Sequences?p. 215
A Loopless Generation of Bitstrings without p Consecutive Onesp. 227
Greedy Algorithms for the Lower and Upper Chromatic Numbersp. 241
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9781852335267
ISBN-10: 1852335262
Series: Discrete Mathematics and Theoretical Computer Science,
Audience: General
Format: Paperback
Language: English
Number Of Pages: 251
Publisher: Springer London Ltd
Country of Publication: GB
Dimensions (cm): 23.39 x 15.6  x 1.4
Weight (kg): 0.37