Machines, computations, and universality : third international conference, MCU 2001, Chişinžu, Moldova, May 23-27 2001 : proceedings

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 aut...

Ful tanımlama

Kaydedildi:
Detaylı Bibliyografya
Müşterek Yazar: International conference on Machines, Computations and Universality :2001
Diğer Yazarlar: Margenstern, Maurice, 19..-...., mathématicien (Yayın yönetmeni), Rogojine, Iouri (Yayın yönetmeni)
Materyal Türü: Livre numérique
Dil:Anglais
Baskı/Yayın Bilgisi: Berlin, Heidelberg : Springer-Verlag Berlin Heidelberg : Springer e-books [20..].
Cham : Springer Nature
Seri Bilgileri:Lecture notes in computer science 2055
Konular:
Online Erişim:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Not: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Machines, Computations, and Universality, third international conference, MCU 2001, Chişinžu, Moldova, May 23-27 2001, proceedings, Maurice Margenstern, Yurii Rogozhin (eds.), 2001, Berlin, Springer, 1 vol. (VIII-319 p.), Lecture notes in computer science, 3-540-42121-1
• Machines, Computations, and Universality, Texte imprimé, 9783662202159
LEADER 06277nam a22004577a 4500
001 948914
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155198386
020 |a 9783540451327 (PDF) 
041 0 |a eng 
082 |a 004 
111 2 |a International conference on Machines, Computations and Universality  |n (03  |c  :2001)  |d (Chişinžu, Moldovie. 
245 1 0 |a Machines, computations, and universality :  |b third international conference, MCU 2001, Chişinžu, Moldova, May 23-27 2001 : proceedings   |c [edited by] Maurice Margenstern, Yurii Rogozhin. 
260 |a Berlin, Heidelberg :  |b Springer-Verlag Berlin Heidelberg :  |b Springer e-books. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science  |v 2055  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a Invited 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. 
506 |a Accès en ligne pour les établissements français bénéficiaires des licences nationales 
506 |a Accès soumis à abonnement pour tout autre établissement 
506 |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 
520 |a 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. 
650 |a Informatique 
650 |a Algorithmes 
650 |a Automates mathématiques, Théorie des 
650 |a Ordinateurs 
650 |a Automates cellulaires 
650 |a Logique symbolique et mathématique 
650 |a Informatique quantique 
650 |a Ordinateurs moléculaires 
650 |a Actes de congrès 
700 1 |a Margenstern, Maurice,  |d 19..-....,  |c mathématicien.  |4 pbd 
700 1 |a Rogojine, Iouri.  |4 pbd 
776 0 |0 057844518  |t Machines, Computations, and Universality  |o third international conference, MCU 2001  |o Chişinžu, Moldova, May 23-27 2001  |o proceedings  |f Maurice Margenstern, Yurii Rogozhin (eds.)  |d 2001  |c Berlin  |n Springer  |p 1 vol. (VIII-319 p.)  |s Lecture notes in computer science  |z 3-540-42121-1 
776 0 |t Machines, Computations, and Universality  |b Texte imprimé  |z 9783662202159 
856 4 |q PDF  |u https://doi.org/10.1007/3-540-45132-3  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-0156V0N0-K  |z Accès sur la plateforme Istex 
856 4 |5 452349901:748061576  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-45132-3  |z Accès Université d'Orléans 
856 4 |5 180339901:751513156  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-45132-3  |z Accès INSA CVL 
997 |0 948914  |1 Livre numérique  |a Ressource numérique  |b INSA  |b ENSA  |c 0/Bibliothèque numérique/  |c 1/Bibliothèque numérique/Autre ressource numérique/