Advertisement

Machines, Computations, and Universality

Third International Conference, MCU 2001 ChişinĂu, Moldova, May 23–27, 2001 Proceedings

  • Maurice Margenstern
  • Yurii Rogozhin
Conference proceedings MCU 2001

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2055)

Table of contents

  1. Front Matter
    Pages I-VIII
  2. Invited Lectures Notes

    1. Claudio Baiocchi
      Pages 1-10
    2. Asa Ben-Hur, Hava T. Siegelmann
      Pages 11-24
    3. Jozef Gruska, Hiroshi Imai
      Pages 25-68
    4. Carlos Martín-Vide, Gheorghe PĂun
      Pages 82-101
    5. Claudio Zandron, Claudio Ferretti, Giancarlo Mauri
      Pages 153-164
  3. Technical Contributions

    1. Vincent D. Blondel, Julien Cassaigne, Codrin Nichitiu
      Pages 165-176
    2. Didier Caucal
      Pages 177-189
  4. JC-Nets

    1. Gabriel Ciobanu, Mihai Rotaru
      Pages 190-201
  5. Nonterminal Complexity of Programmed Grammars

    1. Henning Fernau
      Pages 202-213
  6. On the Number of Non-Terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars

  7. A Direct Construction of a Universal Extended H System

  8. Speeding-Up Cellular Automata by Alternations

    1. Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai
      Pages 240-251
  9. Efficient Universal Pushdown Cellular Automata and Their Application to Complexity

  10. Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints

    1. Salvatore La Torre, Margherita Napoli, Mimmo Parente
      Pages 264-275
  11. P Systems with Membrane Creation: Universality and Efficiency

    1. Madhu Mutyam, Kamala Krithivasan
      Pages 276-287
  12. On the Computational Power of a Continuous-space Optical Model of Computation

  13. On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT)

  14. D0L System + Watson-Crick Complementarity = Universal Computation

  15. Back Matter
    Pages 321-321

About these proceedings

Introduction

In the ?rst part of the present volume of LNCS, the reader will ?nd the invited talks given at the MCU 2001 conference. In the second part, he/she will ?nd the contributions that were presented at the conference after selection. In both cases, papers are arranged in the alphabetical order of the authors. MCU 2001 is the third conference in theoretical computer science, Machines, computations and universality, formerly, Machines et calculs universels. Both previous conferences, MCU’95 and MCU’98, were organized by Maurice M- genstern in Paris and in Metz (France), respectively. From the very beginning, MCU conferences have been an international sci- ti?c event. For the third conference, in order to stress that aspect, it was decided to hold it outside France. Moldova was chosen thanks to the close cooperation between the present chairmen of MCU 2001. MCU 2001 also aims at high scienti?c standards. We hope that the present volume will convince the reader that the tradition of previous conferences have been upheld by this one. Cellular automata and molecular computing are well represented in this volume. And this is also the case for quantum computing, f- mal languages, and the theory of automata. MCU 2001 does not fail its tradition of providing our community with important results on Turing machines.

Keywords

DNA computing Reversible Computing Theoretical computer science Turing machines automata automata theory cellular automata complexity computational complexity decidability formal language formal languages grammars logic quantum computing

Editors and affiliations

  • Maurice Margenstern
    • 1
  • Yurii Rogozhin
    • 2
  1. 1.LITA, UFR MIMUniversité de MetzMetzFrance
  2. 2.Institute of Mathematics and Computer Science of the Academy of Sciences of MoldovaChiŗinău

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-45132-3
  • Copyright Information Springer-Verlag Berlin Heidelberg 2001
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-42121-4
  • Online ISBN 978-3-540-45132-7
  • Series Print ISSN 0302-9743
  • Buy this book on publisher's site