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

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.

---

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.

Content:
Front Matter....Pages i-x
Early Computer Science Adventures of a Mathematician....Pages 1-4
Sequentially Continuity in Constructive Mathematics....Pages 5-12
Recursive Functions: An Archeological Look....Pages 13-31
The Number of Graphs and Digraphs with a Fixed Diameter and Connectivity....Pages 33-46
Some Results for Some Conjectures in Addition Chains....Pages 47-54
A Highly Random Number....Pages 55-68
Dini’s Theorem: A Constructive Case Study....Pages 69-80
Even Linear Simple Matrix Languages: Formal Language Aspects....Pages 81-96
Pseudo-BCK Algebras: An Extension of BCK Algebras....Pages 97-114
P-Immune Sets with Holes Lack Self-Reducibility Properties....Pages 115-124
Lex Ideals of Generalized MV-Algebras....Pages 125-136
Armstrong Systems on Ordered Sets....Pages 137-149
Unicycle Bipartite Graphs with Only Uniquely Restricted Maximum Matchings....Pages 151-157
On Relax-ability of Word-Order by D-grammars....Pages 159-173
On the Structure of Linear Cellular Automata....Pages 175-185
Monotonically Computable Real Numbers....Pages 187-201
Apartness as a Relation Between Subsets....Pages 203-214
How Large is the Set of Disjunctive Sequences?....Pages 215-225
A Loopless Generation of Bitstrings without p Consecutive Ones....Pages 227-240
Greedy Algorithms for the Lower and Upper Chromatic Numbers....Pages 241-251
Back Matter....Pages 253-253

---

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.

Content:
Front Matter....Pages i-x
Early Computer Science Adventures of a Mathematician....Pages 1-4
Sequentially Continuity in Constructive Mathematics....Pages 5-12
Recursive Functions: An Archeological Look....Pages 13-31
The Number of Graphs and Digraphs with a Fixed Diameter and Connectivity....Pages 33-46
Some Results for Some Conjectures in Addition Chains....Pages 47-54
A Highly Random Number....Pages 55-68
Dini’s Theorem: A Constructive Case Study....Pages 69-80
Even Linear Simple Matrix Languages: Formal Language Aspects....Pages 81-96
Pseudo-BCK Algebras: An Extension of BCK Algebras....Pages 97-114
P-Immune Sets with Holes Lack Self-Reducibility Properties....Pages 115-124
Lex Ideals of Generalized MV-Algebras....Pages 125-136
Armstrong Systems on Ordered Sets....Pages 137-149
Unicycle Bipartite Graphs with Only Uniquely Restricted Maximum Matchings....Pages 151-157
On Relax-ability of Word-Order by D-grammars....Pages 159-173
On the Structure of Linear Cellular Automata....Pages 175-185
Monotonically Computable Real Numbers....Pages 187-201
Apartness as a Relation Between Subsets....Pages 203-214
How Large is the Set of Disjunctive Sequences?....Pages 215-225
A Loopless Generation of Bitstrings without p Consecutive Ones....Pages 227-240
Greedy Algorithms for the Lower and Upper Chromatic Numbers....Pages 241-251
Back Matter....Pages 253-253
....