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.
Author(s): Claudio Baiocchi (auth.), Maurice Margenstern, Yurii Rogozhin (eds.)
Series: Lecture Notes in Computer Science 2055
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2001
Language: English
Pages: 328
Tags: Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Logics and Meanings of Programs; Mathematical Logic and Formal Languages
Three Small Universal Turing Machines....Pages 1-10
Computation in Gene Networks....Pages 11-24
Power, Puzzles and Properties of Entanglement....Pages 25-68
Combinatorial and Computational Problems on Finite Sets of Words....Pages 69-81
Computing with Membranes (P Systems): Universality Results....Pages 82-101
A Simple Universal Logic Element and Cellular Automata for Reversible Computing....Pages 102-113
Some Applications of the Decidability of DPDA’s Equivalence....Pages 114-132
The Equivalence Problem for Computational Models: Decidable and Undecidable Cases....Pages 133-152
Two Normal Forms for Rewriting P Systems....Pages 153-164
On a Conjecture of Kůrka. A Turing Machine with No Periodic Configurations....Pages 165-176
On the Transition Graphs of Turing Machines....Pages 177-189
JC-Nets....Pages 190-201
Nonterminal Complexity of Programmed Grammars....Pages 202-213
On the Number of Non-Terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars....Pages 214-225
A Direct Construction of a Universal Extended H System....Pages 226-239
Speeding-Up Cellular Automata by Alternations....Pages 240-251
Efficient Universal Pushdown Cellular Automata and Their Application to Complexity....Pages 252-263
Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints....Pages 264-275
P Systems with Membrane Creation: Universality and Efficiency....Pages 276-287
On the Computational Power of a Continuous-space Optical Model of Computation....Pages 288-299
On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT)....Pages 300-307
D0L System + Watson-Crick Complementarity = Universal Computation....Pages 308-319
