Combinatorics, Computability and Logic

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

  • C. S. Calude
  • M. J. Dinneen
  • S. Sburlan
Conference proceedings

DOI: 10.1007/978-1-4471-0717-0

Part of the Discrete Mathematics and Theoretical Computer Science book series (DISCMATH)

Table of contents

  1. Front Matter
    Pages i-x
  2. Invited Papers

  3. Contributed papers

    1. Hatem M. Bahig, Mohamed H. El-Zahar, Ken Nakamula
      Pages 47-54
    2. Verónica Becher, Sergio Daicz, Gregory Chaitin
      Pages 55-68
    3. Douglas S. Bridges
      Pages 69-80
    4. George Georgescu, Afrodita Iorgulescu
      Pages 97-114
    5. Lane A. Hemaspaandra, Harald Hempel
      Pages 115-124
    6. Daniel Hort, Jiří Rachůnek
      Pages 125-136
    7. Jouni Järvinen
      Pages 137-149
    8. Martin Plátek, Tomáš Holan, Vladislav Kuboň
      Pages 159-173
    9. Adriana Popovici, Dan Popovici
      Pages 175-185
    10. Robert Rettinger, Xizhong Zheng, Romain Gengler, Burchard von Braunmühl
      Pages 187-201
    11. Peter Schuster, Luminiţa Vîţă, Douglas S. Bridges
      Pages 203-214
    12. Ludwig Staiger
      Pages 215-225

About these proceedings

Keywords

Automat Graph Matching Sim algorithms automata complexity formal language logic

Editors and affiliations

  • C. S. Calude
    • 1
  • M. J. Dinneen
    • 1
  • S. Sburlan
    • 2
  1. 1.Department of Computer ScienceUniversity of AucklandAucklandNew Zealand
  2. 2.Faculty of Mathematics and Computer Science“Ovidius” UniversityConstantaRomania

Bibliographic information

  • Copyright Information Springer-Verlag London 2001
  • Publisher Name Springer, London
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-85233-526-7
  • Online ISBN 978-1-4471-0717-0