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...
Guardat en:
| Autor corporatiu: | |
|---|---|
| Altres autors: | , |
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin, Heidelberg :
Springer-Verlag Berlin Heidelberg : Springer e-books
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
2055 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
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 |
Taula de continguts:
- 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.