000 05666nam a22005775i 4500
001 978-3-540-45132-7
003 DE-He213
005 20240423132459.0
007 cr nn 008mamaa
008 121227s2001 gw | s |||| 0|eng d
020 _a9783540451327
_9978-3-540-45132-7
024 7 _a10.1007/3-540-45132-3
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aMachines, Computations, and Universality
_h[electronic resource] :
_bThird International Conference, MCU 2001 Chisinau, Moldava, May 23-27, 2001 Proceedings /
_cedited by Maurice Margenstern, Yurii Rogozhin.
250 _a1st ed. 2001.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2001.
300 _aVIII, 328 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2055
505 0 _aInvited Lectures Notes -- Three Small Universal Turing Machines -- Computation in Gene Networks -- Power, Puzzles and Properties of Entanglement -- Combinatorial and Computational Problems on Finite Sets of Words -- Computing with Membranes (P Systems): Universality Results -- A Simple Universal Logic Element and Cellular Automata for Reversible Computing -- Some Applications of the Decidability of DPDA’s Equivalence -- The Equivalence Problem for Computational Models: Decidable and Undecidable Cases -- Two Normal Forms for Rewriting P Systems -- Technical Contributions -- On a Conjecture of K?rka. A Turing Machine with No Periodic Configurations -- On the Transition Graphs of Turing Machines -- JC-Nets -- JC-Nets -- Nonterminal Complexity of Programmed Grammars -- Nonterminal Complexity of Programmed Grammars -- On the Number of Non-Terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars -- On the Number of Non-Terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars -- A Direct Construction of a Universal Extended H System -- A Direct Construction of a Universal Extended H System -- Speeding-Up Cellular Automata by Alternations -- Speeding-Up Cellular Automata by Alternations -- Efficient Universal Pushdown Cellular Automata and Their Application to Complexity -- Efficient Universal Pushdown Cellular Automata and Their Application to Complexity -- Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints -- Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints -- P Systems with Membrane Creation: Universality and Efficiency -- P Systems with Membrane Creation: Universality and Efficiency -- On the Computational Power of a Continuous-space Optical Model of Computation -- On theComputational Power of a Continuous-space Optical Model of Computation -- On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT) -- On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT) -- D0L System + Watson-Crick Complementarity = Universal Computation -- D0L System + Watson-Crick Complementarity = Universal Computation.
520 _aIn 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.
650 0 _aComputer science.
650 0 _aAlgorithms.
650 0 _aMachine theory.
650 1 4 _aTheory of Computation.
650 2 4 _aAlgorithms.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aFormal Languages and Automata Theory.
700 1 _aMargenstern, Maurice.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aRogozhin, Yurii.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540421214
776 0 8 _iPrinted edition:
_z9783662202159
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2055
856 4 0 _uhttps://doi.org/10.1007/3-540-45132-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188214
_d188214