Descripción del título
Combinatorics, Computabilit...
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
Monografía
monografia Rebiun21551162 https://catalogo.rebiun.org/rebiun/record/Rebiun21551162 m o e cr nn||||||||| 121227s2001 enk o 000 0 eng d 9781447107170 electronic bk.) 1447107179 electronic bk.) UPVA 996967917403706 I9W eng pn I9W OCLCO OCLCQ UV0 OCLCO GW5XE OCLCF UA@ OCLCQ UAB OCLCQ TKN Calude, C. S. Combinatorics, Computability and Logic Proceedings of the Third International Conference on Combinatorics, Computability and Logic, (DMTCS'01) edited by C.S. Calude, M.J. Dinneen, S. Sburlan London Springer London 2001 London London Springer London 1 online resource (x, 251 pages) 1 online resource (x, 251 pages) Text txt rdacontent computer c rdamedia online resource cr rdacarrier Discrete Mathematics and Theoretical Computer Science 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 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 Mathematics Computer software Computer science Combinatorial analysis Combinatorial analysis. Computer science. Computer software. Mathematics. Electronic books Dinneen, M. J. Sburlan, S. Discrete mathematics and theoretical computer science